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 03:57Josu 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 03:58041,104,95031,300,0001,082,0002,113,536expected "53680661624711570 ", got "53680661600288917 "
2May 11, 2026 03:583,86640,350,12931,035,0001,054,0002,113,536
3May 11, 2026 03:583,87641,560,25831,099,0001,073,0002,113,536
4May 11, 2026 03:583,87742,128,55931,109,0001,073,0002,113,536
5May 11, 2026 03:583,91643,663,78331,425,0001,078,0002,113,536
6May 11, 2026 03:583,91942,324,44631,382,0001,153,0002,113,536
7May 11, 2026 03:583,93542,236,78831,584,0001,084,0002,113,536
8May 11, 2026 03:583,96140,552,65531,789,0001,094,0002,113,536
9May 11, 2026 03:583,96542,765,63831,829,0001,088,0002,113,536