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 10:52highload-churnerhighload-churnerScore: 3,256Success
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 10:523,24635,933,88626,946,000020,480
2Oct 14, 2026 10:523,24735,900,60426,955,000020,480
3Oct 14, 2026 10:523,25236,250,71426,992,000020,480
4Oct 14, 2026 10:523,25435,997,39727,013,000020,480
5Oct 14, 2026 10:523,25635,978,86227,033,000020,480
6Oct 14, 2026 10:523,26036,574,86427,064,000020,480
7Oct 14, 2026 10:523,27136,670,27627,156,000020,480
8Oct 14, 2026 10:523,29036,927,69127,308,000020,480
9Oct 14, 2026 10:523,29036,901,95127,312,000020,480