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 9, 2026 19:44Josu San MartinJosu San MartinScore: 5,053Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 19:445,02458,683,43140,667,0001,040,0002,547,712
2May 9, 2026 19:445,03457,198,82640,751,0001,037,0002,543,616
3May 9, 2026 19:445,04557,100,50140,822,0001,057,0002,547,712
4May 9, 2026 19:445,04558,049,98840,822,0001,055,0002,551,808
5May 9, 2026 19:445,05360,333,39740,818,0001,128,0002,543,616
6May 9, 2026 19:445,14360,547,34141,618,0001,075,0002,293,760
7May 9, 2026 19:445,18858,954,97041,938,0001,124,0002,543,616
8May 9, 2026 19:445,20359,224,37842,102,0001,084,0002,543,616
9May 9, 2026 19:446,49070,460,59852,805,0001,062,0002,547,712