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 14, 2026 09:00highload-churnerhighload-churnerScore: 3,257Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2026 09:003,24935,936,07026,970,000020,480
2Oct 14, 2026 09:003,25236,595,79326,999,000020,480
3Oct 14, 2026 09:003,25635,971,79727,027,000020,480
4Oct 14, 2026 09:003,25736,031,01627,037,000020,480
5Oct 14, 2026 09:003,25736,611,04727,041,000020,480
6Oct 14, 2026 09:003,26436,029,97527,095,000020,480
7Oct 14, 2026 09:003,26436,673,39327,093,000020,480
8Oct 14, 2026 09:003,26736,095,82727,122,000020,480
9Oct 14, 2026 09:003,26736,711,75627,124,000020,480