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 00:47highload-churnerhighload-churnerScore: 3,477Success
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 00:483,29936,212,37926,348,0001,034,00020,480
2Oct 13, 2026 00:483,31936,417,53127,555,000020,480
3Oct 13, 2026 00:483,32536,444,43827,601,000020,480
4Oct 13, 2026 00:483,46638,212,41428,776,000020,480
5Oct 13, 2026 00:483,47737,658,77128,866,000020,480
6Oct 13, 2026 00:483,49738,529,23429,030,000020,480
7Oct 13, 2026 00:483,49738,257,21029,032,000020,480
8Oct 13, 2026 00:483,51938,744,20129,212,000020,480
9Oct 13, 2026 00:483,52238,000,38129,238,000020,480