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 15:43Josu San MartinJosu San MartinScore: 4,176Success
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 15:444,14944,145,81933,425,0001,018,0002,113,536
2May 10, 2026 15:444,16242,634,44133,508,0001,043,0002,113,536
3May 10, 2026 15:444,16642,340,00733,541,0001,037,0002,113,536
4May 10, 2026 15:444,17043,929,16533,556,0001,056,0002,113,536
5May 10, 2026 15:444,17643,325,39734,664,00002,113,536
6May 10, 2026 15:444,19044,204,13833,739,0001,040,0002,113,536
7May 10, 2026 15:444,20243,729,04533,845,0001,038,0002,113,536
8May 10, 2026 15:444,20945,759,29433,885,0001,055,0002,113,536
9May 10, 2026 15:444,24644,774,52834,210,0001,035,0002,113,536