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 11:43highload-churnerhighload-churnerScore: 3,268Success
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 11:433,25536,037,41027,023,000020,480
2Oct 14, 2026 11:433,25536,020,80527,018,000020,480
3Oct 14, 2026 11:433,25836,003,06127,049,000020,480
4Oct 14, 2026 11:433,26436,075,37227,092,000020,480
5Oct 14, 2026 11:433,26836,661,35527,131,000020,480
6Oct 14, 2026 11:433,27236,142,87427,162,000020,480
7Oct 14, 2026 11:433,27336,156,15727,166,000020,480
8Oct 14, 2026 11:433,27536,129,65927,190,000020,480
9Oct 14, 2026 11:433,28936,882,70327,306,000020,480