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 07:40Victor MerckléVictor MerckléScore: 3,986Success
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 07:403,97141,169,23031,799,0001,164,0002,117,632stderr
2Sep 1, 2026 07:403,97241,285,51931,816,0001,152,0002,117,632stderr
3Sep 1, 2026 07:403,97441,396,96031,801,0001,187,0002,117,632stderr
4Sep 1, 2026 07:403,97541,372,82631,860,0001,139,0002,117,632stderr
5Sep 1, 2026 07:403,98641,475,69331,903,0001,183,0002,117,632stderr
6Sep 1, 2026 07:403,98841,414,54431,959,0001,144,0002,117,632stderr
7Sep 1, 2026 07:403,99341,525,81332,124,0001,022,0002,117,632stderr
8Sep 1, 2026 07:403,99641,556,13931,994,0001,173,0002,117,632stderr
9Sep 1, 2026 07:404,02941,845,04332,356,0001,085,0002,117,632stderr