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 listMay 22, 2026 08:37Victor MerckléVictor MerckléScore: 8,121Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 08:398,06174,661,39565,903,0001,010,0002,117,632stderr
2May 22, 2026 08:398,08976,374,28566,131,0001,011,0002,117,632stderr
3May 22, 2026 08:398,10475,088,71266,223,0001,046,0002,117,632stderr
4May 22, 2026 08:398,11576,422,35466,271,0001,090,0002,117,632stderr
5May 22, 2026 08:398,12175,222,39666,393,0001,015,0002,117,632stderr
6May 22, 2026 08:398,12175,996,81166,367,0001,044,0002,117,632stderr
7May 22, 2026 08:398,13576,634,11466,487,0001,040,0002,117,632stderr
8May 22, 2026 08:398,22176,297,66067,233,0001,007,0002,117,632stderr
9May 22, 2026 08:398,32576,834,99168,094,0001,007,0002,117,632stderr