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 20, 2026 15:13Victor MerckléVictor MerckléScore: 5,706Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 15:185,69756,211,67446,259,0001,028,0002,113,536
2May 20, 2026 15:185,69955,080,37346,284,0001,022,0002,113,536
3May 20, 2026 15:185,70255,130,13646,293,0001,036,0002,113,536
4May 20, 2026 15:185,70355,132,30946,315,0001,027,0002,113,536
5May 20, 2026 15:185,70658,001,37146,320,0001,042,0002,113,536
6May 20, 2026 15:185,74658,643,67846,669,0001,026,0002,113,536
7May 20, 2026 15:185,86658,199,76447,669,0001,026,0002,113,536
8May 20, 2026 15:185,87058,403,27047,697,0001,027,0002,113,536
9May 20, 2026 15:185,90758,381,20647,903,0001,132,0002,113,536