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 9, 2026 21:25highload-churnerhighload-churnerScore: 3,318Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 21:563,27136,074,75427,156,000020,480
2Oct 9, 2026 21:563,27636,079,71027,198,000020,480
3Oct 9, 2026 21:563,27836,091,02527,214,000020,480
4Oct 9, 2026 21:563,29636,224,97727,365,000020,480
5Oct 9, 2026 21:563,31836,481,65527,543,000020,480
6Oct 9, 2026 21:563,46538,293,40328,767,000020,480
7Oct 9, 2026 21:563,47337,766,57628,830,000020,480
8Oct 9, 2026 21:563,48538,428,44428,928,000020,480
9Oct 9, 2026 21:563,50838,541,96429,118,000020,480