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 listFeb 15, 2026 22:26wnwnScore: 10,042Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 22:268,83095,875,38466,262,0007,027,0002,293,760
2Feb 15, 2026 22:268,864103,475,54665,509,0008,062,0002,502,656
3Feb 15, 2026 22:268,91696,652,74264,001,00010,000,0002,465,792
4Feb 15, 2026 22:2610,042104,381,97874,311,0009,037,0002,277,376
5Feb 15, 2026 22:2610,154108,314,55775,251,0009,030,0002,478,080
6Feb 15, 2026 22:2610,245108,013,20576,031,0009,003,0002,514,944