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 12, 2026 16:07highload-churnerhighload-churnerScore: 3,471Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 16:073,30736,342,81826,444,0001,009,00020,480
2Oct 12, 2026 16:073,34836,657,56427,790,000020,480
3Oct 12, 2026 16:073,41137,162,99028,314,000020,480
4Oct 12, 2026 16:073,42337,311,13128,419,000020,480
5Oct 12, 2026 16:073,47137,661,84628,817,000020,480
6Oct 12, 2026 16:073,47838,381,69428,868,000020,480
7Oct 12, 2026 16:073,49238,511,09028,984,000020,480
8Oct 12, 2026 16:073,50437,947,51929,084,000020,480
9Oct 12, 2026 16:073,50738,592,49829,115,000020,480