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 listFeb 18, 2026 18:23wnwnScore: 7,605Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 18:236,44073,984,25851,434,0002,017,0002,260,992
2Feb 18, 2026 18:236,48180,508,08451,801,0001,992,0002,318,336
3Feb 18, 2026 18:236,51078,828,23052,036,0002,001,0002,293,760
4Feb 18, 2026 18:237,60587,463,39860,119,0003,005,0002,412,544
5Feb 18, 2026 18:237,66690,356,54061,606,0002,019,0002,400,256
6Feb 18, 2026 18:237,78388,161,92461,569,0003,028,0002,437,120