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 20, 2026 16:16Maya RebholzMaya RebholzScore: 10,094Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 16:1710,08094,419,16181,507,0002,162,0002,113,536
2May 20, 2026 16:1710,08294,732,36681,530,0002,156,0002,113,536
3May 20, 2026 16:1710,08396,009,95681,530,0002,160,0002,113,536
4May 20, 2026 16:1710,08595,985,29081,545,0002,167,0002,113,536
5May 20, 2026 16:1710,09494,067,91281,614,0002,168,0002,113,536
6May 20, 2026 16:1710,09495,442,26581,620,0002,168,0002,113,536
7May 20, 2026 16:1710,09694,267,29881,619,0002,183,0002,113,536
8May 20, 2026 16:1710,09797,151,72181,638,0002,172,0002,113,536
9May 20, 2026 16:1710,11696,034,99681,786,0002,184,0002,113,536