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 20:35Victor MerckléVictor MerckléScore: 36,798Success
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 20:3936,706313,204,845303,560,0001,105,0002,117,632stderr
2Sep 8, 2026 20:3936,721313,945,257303,726,0001,062,0002,117,632stderr
3Sep 8, 2026 20:3936,727314,051,497303,694,0001,143,0002,117,632stderr
4Sep 8, 2026 20:3936,757314,521,492303,959,0001,128,0002,117,632stderr
5Sep 8, 2026 20:3936,798314,596,487304,426,0001,001,0002,117,632stderr
6Sep 8, 2026 20:3936,810314,063,474304,500,0001,028,0002,117,632stderr
7Sep 8, 2026 20:3936,844314,365,260303,708,0002,104,0002,117,632stderr
8Sep 8, 2026 20:3936,849314,395,659304,733,0001,116,0002,117,632stderr
9Sep 8, 2026 20:3936,854314,555,888304,888,0001,008,0002,117,632stderr