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 listOct 12, 2026 14:34highload-churnerhighload-churnerScore: 3,721Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 14:343,49737,842,49827,987,0001,041,0002,113,536
2Oct 12, 2026 14:343,51337,982,37228,109,0001,049,0002,113,536
3Oct 12, 2026 14:343,64939,091,80929,288,0001,005,0002,113,536
4Oct 12, 2026 14:343,71039,670,92429,787,0001,012,0002,113,536
5Oct 12, 2026 14:343,72140,413,68129,847,0001,040,0002,113,536
6Oct 12, 2026 14:343,72239,676,88329,860,0001,038,0002,113,536
7Oct 12, 2026 14:343,72739,727,03029,895,0001,041,0002,113,536
8Oct 12, 2026 14:343,73240,435,99029,937,0001,044,0002,113,536
9Oct 12, 2026 14:343,77140,152,65030,299,0001,008,0002,113,536