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 16:47Victor MerckléVictor MerckléScore: 4,099Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 21:34Adam Folwarczny10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 16:484,08941,995,99232,823,0001,118,0002,117,632stderr
2Jul 7, 2026 16:484,09842,056,40632,911,0001,105,0002,117,632stderr
3Jul 7, 2026 16:484,09842,087,65833,000,0001,020,0002,117,632stderr
4Jul 7, 2026 16:484,09842,175,21732,898,0001,117,0002,117,632stderr
5Jul 7, 2026 16:484,09942,037,17533,007,0001,019,0002,117,632stderr
6Jul 7, 2026 16:484,10942,199,57133,102,0001,008,0002,117,632stderr
7Jul 7, 2026 16:484,13642,351,38633,221,0001,112,0002,117,632stderr
8Jul 7, 2026 16:484,14743,759,35333,403,0001,024,0002,117,632stderr
9Jul 7, 2026 16:484,15542,518,82533,389,0001,105,0002,117,632stderr