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 listJul 22, 2026 01:28Kevin HeaveyKevin HeaveyScore: 3,750Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 01:293,58239,406,12528,600,0001,131,0002,113,536
2Jul 22, 2026 01:293,69740,314,79629,537,0001,153,0002,113,536
3Jul 22, 2026 01:293,72040,500,79529,838,0001,042,0002,113,536
4Jul 22, 2026 01:293,73341,182,40629,964,0001,020,0002,113,536
5Jul 22, 2026 01:293,75040,740,76029,977,0001,150,0002,113,536
6Jul 22, 2026 01:293,81742,347,45330,574,0001,108,0002,113,536
7Jul 22, 2026 01:293,82741,381,58730,663,0001,109,0002,113,536
8Jul 22, 2026 01:293,87442,334,24131,111,0001,048,0002,113,536
9Jul 22, 2026 01:293,89242,619,76831,186,0001,124,0002,113,536