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 listMay 14, 2026 14:36Josu San MartinJosu San MartinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 14:37040,418,74332,084,0001,007,0002,113,536expected "53689560997405475 ", got "53689560741405475 "
2May 14, 2026 14:373,99042,178,78232,115,0001,009,0002,113,536
3May 14, 2026 14:373,99142,476,76932,128,0001,004,0002,113,536
4May 14, 2026 14:373,99243,322,11732,138,0001,002,0002,113,536
5May 14, 2026 14:373,99642,217,76032,162,0001,006,0002,113,536
6May 14, 2026 14:374,00541,871,90532,222,0001,026,0002,113,536
7May 14, 2026 14:374,00941,501,86632,268,0001,010,0002,113,536
8May 14, 2026 14:374,03542,332,68532,483,0001,009,0002,113,536
9May 14, 2026 14:374,06542,662,88832,736,0001,005,0002,113,536