Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listJun 27, 2026 13:28Daniel MastalerzDaniel MastalerzError
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 13:28051,280,65940,839,0001,026,0002,113,536expected "53687341190128491 ", got "53687341190128235"
2Jun 27, 2026 13:285,05151,359,22340,905,0001,021,0002,113,536
3Jun 27, 2026 13:285,05351,766,27340,894,0001,054,0002,113,536
4Jun 27, 2026 13:285,05451,483,33840,923,0001,027,0002,113,536
5Jun 27, 2026 13:285,06451,747,74741,002,0001,035,0002,113,536
6Jun 27, 2026 13:285,08151,724,86141,137,0001,039,0002,113,536
7Jun 27, 2026 13:285,08451,600,00941,181,0001,021,0002,113,536
8Jun 27, 2026 13:285,09152,155,87741,200,0001,057,0002,113,536
9Jun 27, 2026 13:285,16760,940,67341,780,0001,113,0002,113,536