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 08:25highload-churnerhighload-churnerScore: 3,329Success
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 08:263,31637,099,38927,529,000020,480
2Oct 14, 2026 08:263,32337,174,02627,589,000020,480
3Oct 14, 2026 08:263,32337,190,48527,585,000020,480
4Oct 14, 2026 08:263,32536,570,55327,604,000020,480
5Oct 14, 2026 08:263,32936,671,95027,636,000020,480
6Oct 14, 2026 08:263,32936,615,87627,635,000020,480
7Oct 14, 2026 08:263,34037,211,00127,724,000020,480
8Oct 14, 2026 08:263,34636,825,43427,773,000020,480
9Oct 14, 2026 08:263,39038,105,46328,138,000020,480