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 listSep 8, 2026 18:13Victor MerckléVictor MerckléScore: 39,923Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 18:1839,673337,854,363328,150,0001,142,0002,117,632stderr
2Sep 8, 2026 18:1839,785340,461,492329,158,0001,060,0002,117,632stderr
3Sep 8, 2026 18:1839,852339,351,141329,637,0001,142,0002,117,632stderr
4Sep 8, 2026 18:1839,907340,449,442330,206,0001,028,0002,117,632stderr
5Sep 8, 2026 18:1839,923340,150,489330,320,0001,048,0002,117,632stderr
6Sep 8, 2026 18:1840,061341,643,661331,491,0001,020,0002,117,632stderr
7Sep 8, 2026 18:1840,104341,396,656331,857,0001,011,0002,117,632stderr
8Sep 8, 2026 18:1840,144342,405,700332,087,0001,116,0002,117,632stderr
9Sep 8, 2026 18:1840,366343,636,624333,943,0001,095,0002,117,632stderr