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 15, 2026 10:50Victor MerckléVictor MerckléScore: 6,967Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 10:516,96365,179,24156,769,0001,028,0002,113,536
2May 15, 2026 10:516,96465,789,99556,803,0001,002,0002,113,536
3May 15, 2026 10:516,96567,324,87456,777,0001,036,0002,113,536
4May 15, 2026 10:516,96668,110,97857,821,00002,113,536
5May 15, 2026 10:516,96766,688,97156,791,0001,042,0002,113,536
6May 15, 2026 10:516,96966,860,44057,846,00002,113,536
7May 15, 2026 10:516,97666,915,93956,862,0001,045,0002,113,536
8May 15, 2026 10:516,98065,490,12856,916,0001,020,0002,113,536
9May 15, 2026 10:517,03567,544,15257,392,0001,001,0002,113,536