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 15:02Victor MerckléVictor MerckléScore: 4,209Success
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 15:054,17343,691,73229,077,0005,563,00024,576stderr
2Sep 8, 2026 15:054,17743,154,05929,125,0005,550,00024,576stderr
3Sep 8, 2026 15:054,18444,753,44229,043,0005,685,00024,576stderr
4Sep 8, 2026 15:054,19443,350,07728,780,0006,032,0002,117,632stderr
5Sep 8, 2026 15:054,20943,607,29829,183,0005,759,0002,117,632stderr
6Sep 8, 2026 15:054,21644,207,89029,350,0005,645,00024,576stderr
7Sep 8, 2026 15:054,21844,177,08829,430,0005,584,00024,576stderr
8Sep 8, 2026 15:054,24244,355,81029,210,0006,000,0002,117,632stderr
9Sep 8, 2026 15:054,26444,011,03029,170,0006,223,0002,117,632stderr