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 10, 2026 18: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 10, 2026 18:49044,648,44433,326,0001,023,0002,113,536expected "53693402066126792 ", got "53693400227382351 "
2May 10, 2026 18:493,94142,928,14131,680,0001,038,0002,113,536
3May 10, 2026 18:493,99041,091,05832,077,0001,040,0002,113,536
4May 10, 2026 18:493,99941,137,62632,186,0001,007,0002,113,536
5May 10, 2026 18:494,00340,565,81432,184,0001,045,0002,113,536
6May 10, 2026 18:494,00542,314,26432,200,0001,042,0002,113,536
7May 10, 2026 18:494,01542,772,08732,324,0001,005,0002,113,536
8May 10, 2026 18:494,02443,566,30032,366,0001,041,0002,113,536
9May 10, 2026 18:494,05746,240,65032,641,0001,039,0002,113,536