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 15:29highload-churnerhighload-churnerScore: 3,193Success
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 15:293,18635,360,52826,451,000020,480
2Oct 14, 2026 15:293,18835,446,14126,463,000020,480
3Oct 14, 2026 15:293,18935,395,61926,469,000020,480
4Oct 14, 2026 15:293,19035,960,67126,484,000020,480
5Oct 14, 2026 15:293,19335,412,82626,509,000020,480
6Oct 14, 2026 15:293,19436,005,84726,516,000020,480
7Oct 14, 2026 15:293,19935,525,84226,559,000020,480
8Oct 14, 2026 15:293,20537,020,32826,605,000020,480
9Oct 14, 2026 15:293,20735,610,38126,623,000020,480