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 24, 2026 22:22Victor MerckléVictor MerckléScore: 11,557Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 22:2311,542104,190,39894,671,0001,133,0002,117,632stderr
2Aug 24, 2026 22:2311,543104,180,98394,695,0001,112,0002,117,632stderr
3Aug 24, 2026 22:2311,545104,218,96894,751,0001,077,0002,117,632stderr
4Aug 24, 2026 22:2311,553104,527,44794,778,0001,117,0002,117,632stderr
5Aug 24, 2026 22:2311,557104,395,48494,795,0001,131,0002,117,632stderr
6Aug 24, 2026 22:2311,563104,367,76394,855,0001,119,0002,117,632stderr
7Aug 24, 2026 22:2311,573104,538,52694,962,0001,095,0002,117,632stderr
8Aug 24, 2026 22:2311,577104,460,34094,992,0001,098,0002,117,632stderr
9Aug 24, 2026 22:2311,607104,746,03095,251,0001,090,0002,117,632stderr