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 03:43Josu San MartinJosu San MartinScore: 4,431Success
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 03:444,40851,115,35035,574,0001,020,0002,351,104
2May 10, 2026 03:444,41651,782,59635,625,0001,031,0002,355,200
3May 10, 2026 03:444,41651,584,00435,603,0001,052,0002,359,296
4May 10, 2026 03:444,42550,854,63635,580,0001,148,0002,355,200
5May 10, 2026 03:444,43153,942,72235,609,0001,169,0002,363,392
6May 10, 2026 03:444,43855,891,75635,824,0001,019,0002,355,200
7May 10, 2026 03:444,44353,204,63035,829,0001,055,0002,359,296
8May 10, 2026 03:444,46254,371,86136,012,0001,026,0002,355,200
9May 10, 2026 03:444,58453,804,73436,886,0001,169,0002,359,296