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 14:14Victor MerckléVictor MerckléScore: 3,709Success
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 14:183,62339,594,13528,610,0001,467,0002,117,632stderr
2Sep 8, 2026 14:183,64138,741,77428,618,0001,608,00024,576stderr
3Sep 8, 2026 14:183,69939,384,30829,165,0001,544,00024,576stderr
4Sep 8, 2026 14:183,69939,206,07829,333,0001,374,0002,117,632stderr
5Sep 8, 2026 14:183,70939,222,99129,225,0001,560,0002,117,632stderr
6Sep 8, 2026 14:183,71239,311,43429,282,0001,534,00024,576stderr
7Sep 8, 2026 14:183,74939,555,19429,496,0001,627,00024,576stderr
8Sep 8, 2026 14:183,75039,650,02129,588,0001,543,00024,576stderr
9Sep 8, 2026 14:183,76839,696,28529,803,0001,473,0002,117,632stderr