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 14, 2026 04:35Victor MerckléVictor MerckléScore: 6,998Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 04:356,99465,399,71658,056,00002,113,536
2May 14, 2026 04:356,99566,775,96457,024,0001,036,0002,113,536
3May 14, 2026 04:356,99667,722,21057,029,0001,042,0002,113,536
4May 14, 2026 04:356,99767,789,58857,075,0001,006,0002,113,536
5May 14, 2026 04:356,99866,750,25957,084,0001,007,0002,113,536
6May 14, 2026 04:357,00065,603,91457,073,0001,029,0002,113,536
7May 14, 2026 04:357,04867,054,24457,492,0001,012,0002,113,536
8May 14, 2026 04:357,04868,766,47457,476,0001,026,0002,113,536
9May 14, 2026 04:357,05266,119,20257,537,0001,001,0002,113,536