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:49Maya RebholzMaya RebholzScore: 10,488Success
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:4910,48396,488,52884,860,0002,156,0002,113,536
2May 20, 2026 16:4910,48497,742,66484,830,0002,191,0002,113,536
3May 20, 2026 16:4910,48797,114,63084,885,0002,165,0002,113,536
4May 20, 2026 16:4910,48797,184,03084,867,0002,176,0002,113,536
5May 20, 2026 16:4910,48897,193,57984,889,0002,168,0002,113,536
6May 20, 2026 16:4910,48898,127,19884,892,0002,164,0002,113,536
7May 20, 2026 16:4910,49999,454,23184,932,0002,212,0002,113,536
8May 20, 2026 16:4910,49998,961,01084,913,0002,234,0002,113,536
9May 20, 2026 16:4910,50998,166,69184,940,0002,287,0002,113,536