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 13, 2026 06:45highload-churnerhighload-churnerScore: 3,470Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 06:453,34036,610,87727,724,000020,480
2Oct 13, 2026 06:453,41137,148,11928,318,000020,480
3Oct 13, 2026 06:453,43538,058,52028,512,000020,480
4Oct 13, 2026 06:453,43637,995,32628,527,000020,480
5Oct 13, 2026 06:453,47037,663,53328,801,000020,480
6Oct 13, 2026 06:453,47337,733,89128,831,000020,480
7Oct 13, 2026 06:453,48238,375,58228,907,000020,480
8Oct 13, 2026 06:453,48237,767,46528,902,000020,480
9Oct 13, 2026 06:453,48538,536,85528,927,000020,480