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 14:41highload-churnerhighload-churnerScore: 3,195Success
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 14:423,18535,649,61726,442,000020,480
2Oct 14, 2026 14:423,18635,962,77426,452,000020,480
3Oct 14, 2026 14:423,19135,465,36926,489,000020,480
4Oct 14, 2026 14:423,19436,095,19726,515,000020,480
5Oct 14, 2026 14:423,19536,123,72226,522,000020,480
6Oct 14, 2026 14:423,19735,471,63026,542,000020,480
7Oct 14, 2026 14:423,20036,148,38926,564,000020,480
8Oct 14, 2026 14:423,20235,559,93426,579,000020,480
9Oct 14, 2026 14:423,20535,608,53426,608,000020,480