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 11, 2026 18:48Victor MerckléVictor MerckléScore: 13,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2026 18:5213,490120,703,177110,324,0001,651,00024,576stderr
2Sep 11, 2026 18:5213,492120,677,799110,477,0001,512,00024,576stderr
3Sep 11, 2026 18:5213,525121,145,179109,456,0002,809,00024,576stderr
4Sep 11, 2026 18:5213,579123,011,199110,033,0002,674,00024,576stderr
5Sep 11, 2026 18:5213,608122,215,482111,190,0001,758,00024,576stderr
6Sep 11, 2026 18:5213,683122,889,028111,811,0001,761,00024,576stderr
7Sep 11, 2026 18:5213,747123,384,537109,628,0004,475,0002,117,632stderr
8Sep 11, 2026 18:5213,753125,829,623109,952,0004,206,0002,117,632stderr
9Sep 11, 2026 18:5213,839124,194,590110,448,0004,416,0002,117,632stderr