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 12:22Victor MerckléVictor MerckléScore: 4,044Success
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 12:254,00741,725,63928,939,0004,325,0002,117,632stderr
2Sep 8, 2026 12:254,01741,851,94029,332,0004,013,00024,576stderr
3Sep 8, 2026 12:254,02342,483,91328,984,0004,409,0002,117,632stderr
4Sep 8, 2026 12:254,02842,563,59328,860,0004,573,00024,576stderr
5Sep 8, 2026 12:254,04442,702,34629,012,0004,554,00024,576stderr
6Sep 8, 2026 12:254,07342,323,86529,454,0004,353,00024,576stderr
7Sep 8, 2026 12:254,08643,019,40029,442,0004,474,0002,117,632stderr
8Sep 8, 2026 12:254,08742,545,28729,336,0004,587,0002,117,632stderr
9Sep 8, 2026 12:254,17243,147,67029,695,0004,937,0002,117,632stderr