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 listAug 16, 2026 13:16marko1597marko1597Score: 6,141Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 13:396,06860,245,96549,209,0001,162,0002,113,536
2Aug 16, 2026 13:396,06960,178,02849,216,0001,160,0002,113,536
3Aug 16, 2026 13:396,07560,294,03249,411,0001,012,0002,113,536
4Aug 16, 2026 13:396,11460,575,33949,571,0001,180,0002,113,536
5Aug 16, 2026 13:396,14160,799,86749,797,0001,180,0002,113,536
6Aug 16, 2026 13:396,17061,378,43350,206,0001,006,0002,113,536
7Aug 16, 2026 13:396,17561,057,33150,250,0001,005,0002,113,536
8Aug 16, 2026 13:396,18962,460,76550,182,0001,192,0002,113,536
9Aug 16, 2026 13:396,21561,443,78450,425,0001,162,0002,113,536