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 16, 2026 01:56Victor MerckléVictor MerckléScore: 6,990Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 01:566,96567,265,40356,794,0001,018,0002,113,536
2May 16, 2026 01:566,96766,014,83056,805,0001,023,0002,113,536
3May 16, 2026 01:566,97265,214,05556,864,0001,005,0002,113,536
4May 16, 2026 01:566,97365,193,87456,838,0001,044,0002,113,536
5May 16, 2026 01:566,99067,344,10156,975,0001,048,0002,113,536
6May 16, 2026 01:567,01567,765,65957,196,0001,035,0002,113,536
7May 16, 2026 01:567,02167,085,61857,280,0001,001,0002,113,536
8May 16, 2026 01:567,02166,091,80157,256,0001,021,0002,113,536
9May 16, 2026 01:567,08468,107,49157,793,0001,008,0002,113,536