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 listJul 9, 2026 12:59Victor MerckléVictor MerckléScore: 92,655Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 13:0091,621768,550,453759,361,0001,096,0002,117,632stderr
2Jul 9, 2026 13:0091,763770,274,674760,617,0001,022,0002,117,632stderr
3Jul 9, 2026 13:0091,873770,508,497761,545,0001,008,0002,117,632stderr
4Jul 9, 2026 13:0092,460775,616,097766,418,0001,004,0002,117,632stderr
5Jul 9, 2026 13:0092,655776,996,753768,031,0001,013,0002,117,632stderr
6Jul 9, 2026 13:0092,717777,544,943768,554,0001,004,0002,117,632stderr
7Jul 9, 2026 13:0092,791779,746,386769,169,0001,000,0002,117,632stderr
8Jul 9, 2026 13:0093,206781,566,173772,572,0001,043,0002,117,632stderr
9Jul 9, 2026 13:0093,291782,200,887773,190,0001,128,0002,117,632stderr