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 7, 2026 05:42Victor MerckléVictor MerckléScore: 4,737Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 05:57wn10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:444,71849,519,99838,071,0001,095,0002,142,208stderr
2Jul 7, 2026 05:444,72949,729,48838,198,0001,053,0002,142,208stderr
3Jul 7, 2026 05:444,72957,157,29438,166,0001,092,0002,142,208stderr
4Jul 7, 2026 05:444,73249,717,53838,186,0001,094,0002,142,208stderr
5Jul 7, 2026 05:444,73749,823,05938,243,0001,081,0002,142,208stderr
6Jul 7, 2026 05:444,73849,834,28538,254,0001,078,0002,142,208stderr
7Jul 7, 2026 05:444,73851,087,52638,266,0001,061,0002,142,208stderr
8Jul 7, 2026 05:444,75549,826,47238,397,0001,075,0002,142,208stderr
9Jul 7, 2026 05:444,95851,721,35040,056,0001,097,0002,142,208stderr