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 08:14Josu San MartinJosu San MartinScore: 4,160Success
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 08:154,13647,948,17933,264,0001,072,0002,551,808
2May 10, 2026 08:154,14147,990,36233,355,0001,021,0002,543,616
3May 10, 2026 08:154,15548,684,28833,429,0001,058,0002,547,712
4May 10, 2026 08:154,15550,362,79233,381,0001,109,0002,547,712
5May 10, 2026 08:154,16052,933,39533,438,0001,095,0002,560,000
6May 10, 2026 08:154,16149,459,63233,461,0001,081,0002,547,712
7May 10, 2026 08:154,16952,807,99233,501,0001,103,0002,555,904
8May 10, 2026 08:154,28153,214,31834,424,0001,116,0002,547,712
9May 10, 2026 08:154,29952,981,70434,588,0001,094,0002,543,616