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 listSep 6, 2026 09:40Kevin HeaveyKevin HeaveyScore: 3,534Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 09:413,51537,646,76728,140,0001,039,0002,113,536
2Sep 6, 2026 09:413,52337,898,98328,006,0001,241,0002,113,536
3Sep 6, 2026 09:413,52437,869,73128,009,0001,245,0002,113,536
4Sep 6, 2026 09:413,52537,870,75728,177,0001,082,0002,113,536
5Sep 6, 2026 09:413,53437,915,17628,306,0001,033,0002,113,536
6Sep 6, 2026 09:413,54137,996,74928,354,0001,038,0002,113,536
7Sep 6, 2026 09:413,54537,973,03328,384,0001,040,0002,113,536
8Sep 6, 2026 09:413,54637,838,28428,385,0001,048,0002,113,536
9Sep 6, 2026 09:413,55938,092,45428,475,0001,069,0002,113,536