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 13:58Victor MerckléVictor MerckléScore: 3,732Success
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:013,63138,595,53928,676,0001,467,00024,576stderr
2Sep 8, 2026 14:013,64038,724,76528,727,0001,487,00024,576stderr
3Sep 8, 2026 14:013,72039,417,04229,413,0001,465,00024,576stderr
4Sep 8, 2026 14:013,72840,046,18329,308,0001,641,0002,117,632stderr
5Sep 8, 2026 14:013,73240,145,71729,489,0001,489,00024,576stderr
6Sep 8, 2026 14:013,74140,300,00729,465,0001,586,00024,576stderr
7Sep 8, 2026 14:013,74539,603,85629,443,0001,641,00024,576stderr
8Sep 8, 2026 14:013,76940,535,70929,558,0001,730,0002,117,632stderr
9Sep 8, 2026 14:013,79640,065,62628,736,0002,777,0002,117,632stderr