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 listJun 23, 2026 14:22Victor MerckléVictor MerckléScore: 4,549Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 14:234,50945,142,51936,297,0001,134,0002,117,632stderr
2Jun 23, 2026 14:234,52345,182,82136,458,0001,087,0002,117,632stderr
3Jun 23, 2026 14:234,52845,287,13936,543,0001,046,0002,117,632stderr
4Jun 23, 2026 14:234,53545,240,97736,629,0001,012,0002,117,632stderr
5Jun 23, 2026 14:234,54945,451,36736,724,0001,034,0002,117,632stderr
6Jun 23, 2026 14:234,55245,450,82836,679,0001,109,0002,117,632stderr
7Jun 23, 2026 14:234,55745,463,21136,720,0001,107,0002,117,632stderr
8Jun 23, 2026 14:234,71246,536,91538,089,0001,021,0002,117,632stderr
9Jun 23, 2026 14:234,72446,855,64038,091,0001,126,0002,117,632stderr