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:32Josu San MartinJosu San MartinScore: 4,406Success
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:324,38552,660,21435,277,0001,122,0002,551,808
2May 10, 2026 03:324,38553,246,38535,311,0001,089,0002,543,616
3May 10, 2026 03:324,38753,659,33735,317,0001,102,0002,555,904
4May 10, 2026 03:324,39652,004,69535,391,0001,101,0002,551,808
5May 10, 2026 03:324,40651,045,15035,423,0001,153,0002,531,328
6May 10, 2026 03:324,41254,284,70935,516,0001,104,0002,547,712
7May 10, 2026 03:324,41952,105,23635,563,0001,122,0002,555,904
8May 10, 2026 03:324,44354,897,97935,779,0001,102,0002,547,712
9May 10, 2026 03:324,45553,791,27135,934,0001,044,0002,547,712