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 listAug 12, 2026 09:28Victor MerckléVictor MerckléScore: 3,885Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 09:293,82440,182,54330,635,0001,109,0002,117,632stderr
2Aug 12, 2026 09:293,84840,342,31330,796,0001,147,0002,117,632stderr
3Aug 12, 2026 09:293,87440,606,92131,004,0001,154,0002,117,632stderr
4Aug 12, 2026 09:293,88040,643,41031,069,0001,139,0002,117,632stderr
5Aug 12, 2026 09:293,88540,690,27831,151,0001,095,0002,117,632stderr
6Aug 12, 2026 09:293,88840,686,92231,200,0001,078,0002,117,632stderr
7Aug 12, 2026 09:293,88940,714,79231,080,0001,202,0002,117,632stderr
8Aug 12, 2026 09:293,90540,855,41631,297,0001,116,0002,117,632stderr
9Aug 12, 2026 09:294,13743,334,57033,173,0001,165,0002,117,632stderr