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 7, 2026 17:08Victor MerckléVictor MerckléScore: 4,625Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 17:094,51045,929,53931,399,0006,039,00024,576stderr
2Sep 7, 2026 17:094,53046,069,99831,295,0006,310,0002,117,632stderr
3Sep 7, 2026 17:094,54946,269,25631,094,0006,664,00024,576stderr
4Sep 7, 2026 17:094,59946,709,00632,251,0005,923,00024,576stderr
5Sep 7, 2026 17:094,62547,930,82932,335,0006,057,0002,117,632stderr
6Sep 7, 2026 17:094,69647,660,98031,431,0007,549,00024,576stderr
7Sep 7, 2026 17:094,82448,540,09533,804,0006,236,0002,117,632stderr
8Sep 7, 2026 17:094,84048,783,46231,804,0008,369,00024,576stderr
9Sep 7, 2026 17:094,89649,196,42831,671,0008,969,0002,117,632stderr