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 05:07Josu 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 05:07048,862,79933,377,0001,037,0002,486,272expected "53688984897679552 ", got "53688984853788634 "
2May 10, 2026 05:074,12050,643,00033,165,0001,038,0002,490,368
3May 10, 2026 05:074,12551,554,52033,192,0001,049,0002,486,272
4May 10, 2026 05:074,12950,965,69233,163,0001,112,0002,486,272
5May 10, 2026 05:074,13051,041,78733,230,0001,054,0002,486,272
6May 10, 2026 05:074,13748,405,14133,272,0001,071,0002,482,176
7May 10, 2026 05:074,13949,278,03333,300,0001,058,0002,486,272
8May 10, 2026 05:074,14748,884,51933,389,0001,038,0002,486,272
9May 10, 2026 05:074,15451,695,64533,431,0001,048,0002,490,368