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 22:01Victor 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 22:016,94967,052,38456,645,0001,035,0002,113,536
2May 15, 2026 22:016,95067,768,97656,678,0001,014,0002,113,536
3May 15, 2026 22:016,95366,337,97456,695,0001,016,0002,113,536
4May 15, 2026 22:016,95566,319,06556,712,0001,021,0002,113,536
5May 15, 2026 22:016,96768,191,83956,782,0001,048,0002,113,536
6May 15, 2026 22:017,02966,406,88257,317,0001,030,0002,113,536
7May 15, 2026 22:017,03566,567,72557,352,0001,044,0002,113,536
8May 15, 2026 22:017,09666,823,26857,880,0001,022,0002,113,536
9May 15, 2026 22:017,18869,324,92058,630,0001,034,0002,113,536