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 1, 2026 06:36Victor MerckléVictor MerckléScore: 3,929Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 06:363,91341,562,19731,350,0001,135,0002,117,632stderr
2Sep 1, 2026 06:363,91641,159,44731,370,0001,136,0002,117,632stderr
3Sep 1, 2026 06:363,91640,920,13931,400,0001,106,0002,117,632stderr
4Sep 1, 2026 06:363,91740,899,22531,416,0001,099,0002,117,632stderr
5Sep 1, 2026 06:363,92941,018,56031,505,0001,106,0002,117,632stderr
6Sep 1, 2026 06:363,94241,105,21831,605,0001,121,0002,117,632stderr
7Sep 1, 2026 06:363,94741,139,45231,654,0001,110,0002,117,632stderr
8Sep 1, 2026 06:363,94841,145,86631,642,0001,127,0002,117,632stderr
9Sep 1, 2026 06:363,95041,177,96231,645,0001,144,0002,117,632stderr