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:59Josu San MartinJosu San MartinScore: 4,360Success
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:594,35351,375,28935,105,0001,026,0002,560,000
2May 10, 2026 03:594,35450,829,25034,968,0001,178,0002,547,712
3May 10, 2026 03:594,35450,908,97635,107,0001,032,0002,551,808
4May 10, 2026 03:594,35654,438,71135,137,0001,024,0002,555,904
5May 10, 2026 03:594,36051,325,93435,161,0001,031,0002,551,808
6May 10, 2026 03:594,36252,685,69535,032,0001,174,0002,543,616
7May 10, 2026 03:594,37053,670,99035,250,0001,029,0002,555,904
8May 10, 2026 03:594,38150,698,08135,248,0001,119,0002,547,712
9May 10, 2026 03:594,38153,799,59235,251,0001,118,0002,555,904