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 14:08wnwnScore: 3,415Success
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 14:093,26237,435,85727,078,00002,113,536
2May 10, 2026 14:093,32848,984,96726,614,0001,012,0002,113,536
3May 10, 2026 14:093,35136,795,15027,821,00002,113,536
4May 10, 2026 14:093,41336,917,09328,328,00002,113,536
5May 10, 2026 14:093,41535,576,34828,346,00002,113,536
6May 10, 2026 14:093,41738,781,80128,367,00002,113,536
7May 10, 2026 14:093,42538,896,19628,428,00002,113,536
8May 10, 2026 14:093,43337,021,08328,502,00002,113,536
9May 10, 2026 14:093,43341,717,99928,499,00002,113,536