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 17:32Victor MerckléVictor MerckléScore: 41,624Success
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 17:3641,464352,717,266337,293,0006,861,0002,117,632stderr
2Sep 8, 2026 17:3641,499353,025,331337,220,0007,222,00024,576stderr
3Sep 8, 2026 17:3641,528353,786,611337,502,0007,184,0002,117,632stderr
4Sep 8, 2026 17:3641,610353,855,939338,502,0006,864,00024,576stderr
5Sep 8, 2026 17:3641,624354,033,298338,357,0007,124,0002,117,632stderr
6Sep 8, 2026 17:3641,860356,685,925339,855,0007,586,00024,576stderr
7Sep 8, 2026 17:3642,443360,906,247337,065,00015,219,0002,117,632stderr
8Sep 8, 2026 17:3642,684362,820,913337,698,00016,584,0002,117,632stderr
9Sep 8, 2026 17:3642,851364,271,061339,166,00016,500,0002,117,632stderr