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 21:07Victor MerckléVictor MerckléScore: 3,563Success
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 21:113,50538,345,53428,001,0001,095,0002,117,632stderr
2Sep 8, 2026 21:113,51837,936,85628,100,0001,103,0002,117,632stderr
3Sep 8, 2026 21:113,54038,638,59828,282,0001,101,0002,117,632stderr
4Sep 8, 2026 21:113,56038,223,69128,434,0001,121,0002,117,632stderr
5Sep 8, 2026 21:113,56338,847,72028,433,0001,143,0002,117,632stderr
6Sep 8, 2026 21:113,57137,956,96528,450,0001,193,0002,117,632stderr
7Sep 8, 2026 21:113,57138,895,98328,523,0001,124,0002,117,632stderr
8Sep 8, 2026 21:113,57238,122,67028,636,0001,014,0002,117,632stderr
9Sep 8, 2026 21:113,57338,134,03728,569,0001,089,0002,117,632stderr