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 09:03Victor MerckléVictor MerckléScore: 4,319Success
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 09:064,22243,499,69131,986,0003,063,00024,576stderr
2Sep 8, 2026 09:064,23644,293,86132,031,0003,135,00024,576stderr
3Sep 8, 2026 09:064,28344,063,66232,204,0003,348,00024,576stderr
4Sep 8, 2026 09:064,30344,895,96432,359,0003,363,00024,576stderr
5Sep 8, 2026 09:064,31945,071,61432,159,0003,692,00024,576stderr
6Sep 8, 2026 09:064,35544,773,67132,227,0003,920,00024,576stderr
7Sep 8, 2026 09:064,41945,799,19432,378,0004,300,00024,576stderr
8Sep 8, 2026 09:064,47046,280,21032,172,0004,931,0002,117,632stderr
9Sep 8, 2026 09:064,52346,080,55732,229,0005,313,00024,576stderr