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 04:16Josu 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 04:160205,731,938194,468,0001,113,0002,113,536expected "53698155322521697 ", got "53698155066521697 "
2May 11, 2026 04:1623,559204,422,401194,472,0001,074,0002,113,536
3May 11, 2026 04:1623,565203,293,014194,490,0001,100,0002,113,536
4May 11, 2026 04:1623,579205,820,422194,704,0001,009,0002,113,536
5May 11, 2026 04:1623,580204,721,389194,579,0001,143,0002,113,536
6May 11, 2026 04:1623,593205,782,305194,745,0001,079,0002,113,536
7May 11, 2026 04:1623,602205,795,476194,755,0001,149,0002,113,536
8May 11, 2026 04:1623,609204,665,829194,868,0001,088,0002,113,536
9May 11, 2026 04:1623,614206,207,003194,934,0001,070,0002,113,536