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 26, 2026 04:57Victor MerckléVictor MerckléScore: 4,268Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 04:584,10942,461,09533,003,0001,109,0002,117,632stderr
2Aug 26, 2026 04:584,11642,562,26733,019,0001,145,0002,117,632stderr
3Aug 26, 2026 04:584,11842,580,21733,114,0001,073,0002,117,632stderr
4Aug 26, 2026 04:584,12242,659,69733,207,0001,013,0002,117,632stderr
5Aug 26, 2026 04:584,26843,809,23334,267,0001,158,0002,117,632stderr
6Aug 26, 2026 04:584,27143,826,87634,304,0001,146,0002,117,632stderr
7Aug 26, 2026 04:584,29144,048,15834,458,0001,161,0002,117,632stderr
8Aug 26, 2026 04:584,29444,187,02234,483,0001,161,0002,117,632stderr
9Aug 26, 2026 04:584,32644,319,33734,820,0001,089,0002,117,632stderr