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 11, 2026 00:49Josu 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 11, 2026 00:49040,226,46031,311,0001,064,0002,113,536expected "53692040352973475 ", got "53692040096973475 "
2May 11, 2026 00:493,85741,595,80930,936,0001,079,0002,113,536
3May 11, 2026 00:493,86339,695,64230,998,0001,073,0002,113,536
4May 11, 2026 00:493,86641,688,58031,004,0001,086,0002,113,536
5May 11, 2026 00:493,88141,951,85931,156,0001,064,0002,113,536
6May 11, 2026 00:493,88640,577,91131,177,0001,077,0002,113,536
7May 11, 2026 00:493,92140,556,33531,481,0001,066,0002,113,536
8May 11, 2026 00:493,92341,708,03631,465,0001,098,0002,113,536
9May 11, 2026 00:493,92442,263,50131,510,0001,065,0002,113,536