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 listAug 27, 2026 03:12Victor MerckléVictor MerckléScore: 27,411Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 03:1326,866231,377,428221,990,0001,006,0002,117,632stderr
2Aug 27, 2026 03:1327,254235,271,105225,205,0001,006,0002,117,632stderr
3Aug 27, 2026 03:1327,291234,863,338225,514,0001,004,0002,117,632stderr
4Aug 27, 2026 03:1327,304235,065,880225,625,0001,006,0002,117,632stderr
5Aug 27, 2026 03:1327,411235,932,103226,513,0001,005,0002,117,632stderr
6Aug 27, 2026 03:1327,534236,913,474227,528,0001,006,0002,117,632stderr
7Aug 27, 2026 03:1327,625239,559,153228,287,0001,005,0002,117,632stderr
8Aug 27, 2026 03:1327,677238,095,188228,719,0001,005,0002,117,632stderr
9Aug 27, 2026 03:1327,796239,850,374229,713,0001,002,0002,117,632stderr