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 12:35Victor MerckléVictor MerckléScore: 6,969Success
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 12:356,96666,984,80657,823,00002,113,536
2May 15, 2026 12:356,96665,531,53957,823,00002,113,536
3May 15, 2026 12:356,96768,104,60357,830,00002,113,536
4May 15, 2026 12:356,96765,125,43256,823,0001,007,0002,113,536
5May 15, 2026 12:356,96965,734,80557,846,00002,113,536
6May 15, 2026 12:356,97166,416,51657,866,00002,113,536
7May 15, 2026 12:356,97770,042,11956,866,0001,045,0002,113,536
8May 15, 2026 12:357,01765,565,36658,249,00002,113,536
9May 15, 2026 12:357,07867,121,11357,708,0001,047,0002,113,536