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:23highload-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:243,17636,625,13526,363,000020,480
2Oct 14, 2026 15:243,18135,314,38326,404,000020,480
3Oct 14, 2026 15:243,18335,558,74426,426,000020,480
4Oct 14, 2026 15:243,19035,467,43026,478,000020,480
5Oct 14, 2026 15:243,19335,508,41926,505,000020,480
6Oct 14, 2026 15:243,19636,086,40626,528,000020,480
7Oct 14, 2026 15:243,20036,100,21226,561,000020,480
8Oct 14, 2026 15:243,20135,513,25826,572,000020,480
9Oct 14, 2026 15:243,20736,145,18126,621,000020,480