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 listApr 4, 2026 10:27Adewuyi IsraelAdewuyi IsraelScore: 2,068,701Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 4, 2026 10:272,067,36517,197,943,50617,092,160,00066,969,0002,281,472
2Apr 4, 2026 10:272,067,71817,200,625,48317,114,080,00047,977,0002,281,472
3Apr 4, 2026 10:272,067,85317,193,812,09617,087,218,00075,965,0002,281,472
4Apr 4, 2026 10:272,068,68317,199,728,15217,100,099,00069,971,0002,293,760
5Apr 4, 2026 10:272,068,70117,210,440,03317,090,260,00079,959,0002,281,472
6Apr 4, 2026 10:272,068,82117,206,202,20217,102,247,00068,964,0002,281,472
7Apr 4, 2026 10:272,072,77417,239,767,12417,133,051,00070,971,0002,281,472
8Apr 4, 2026 10:272,075,46817,267,572,75217,172,411,00053,976,0002,281,472
9Apr 4, 2026 10:272,267,69018,855,174,52818,752,864,00068,966,0002,281,472