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 listJun 25, 2026 17:03Victor MerckléVictor MerckléScore: 5,585Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 17:045,53653,481,03944,825,0001,131,0002,117,632stderr
2Jun 25, 2026 17:045,53953,501,18544,844,0001,133,0002,117,632stderr
3Jun 25, 2026 17:045,54853,717,48144,904,0001,146,0002,117,632stderr
4Jun 25, 2026 17:045,55653,743,35144,953,0001,168,0002,117,632stderr
5Jun 25, 2026 17:045,58553,890,07345,234,0001,126,0002,117,632stderr
6Jun 25, 2026 17:045,60754,070,38845,402,0001,144,0002,117,632stderr
7Jun 25, 2026 17:045,64454,417,02645,806,0001,042,0002,117,632stderr
8Jun 25, 2026 17:045,69054,736,22746,102,0001,132,0002,117,632stderr
9Jun 25, 2026 17:045,78555,587,26846,867,0001,151,0002,117,632stderr