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 11, 2026 15:31Victor MerckléVictor MerckléScore: 36,577Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2026 15:3736,438311,206,882301,416,0001,022,0002,117,632stderr
2Sep 11, 2026 15:3736,506311,752,589301,837,0001,167,0002,117,632stderr
3Sep 11, 2026 15:3736,535312,550,936302,234,0001,010,0002,117,632stderr
4Sep 11, 2026 15:3736,559312,716,245302,314,0001,130,0002,117,632stderr
5Sep 11, 2026 15:3736,577312,910,853302,445,0001,150,0002,117,632stderr
6Sep 11, 2026 15:3736,627312,757,429302,848,0001,157,0002,117,632stderr
7Sep 11, 2026 15:3736,677313,191,905303,411,0001,012,0002,117,632stderr
8Sep 11, 2026 15:3736,683313,786,612303,332,0001,138,0002,117,632stderr
9Sep 11, 2026 15:3737,088317,255,673306,729,0001,105,0002,117,632stderr