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 19, 2026 08:05poilonpoilonScore: 15,991Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 08:0515,887142,805,766130,859,0001,005,0002,113,536
2May 19, 2026 08:0515,971143,589,899131,556,0001,007,0002,113,536
3May 19, 2026 08:0515,982143,779,641131,647,0001,006,0002,113,536
4May 19, 2026 08:0515,985142,895,224131,676,0001,006,0002,113,536
5May 19, 2026 08:0515,991142,918,873131,721,0001,005,0002,113,536
6May 19, 2026 08:0516,000142,580,775131,803,0001,005,0002,113,536
7May 19, 2026 08:0516,005142,085,298131,842,0001,006,0002,113,536
8May 19, 2026 08:0516,017142,696,787131,944,0001,005,0002,113,536
9May 19, 2026 08:0516,029144,993,887132,042,0001,006,0002,113,536