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:29highload-churnerhighload-churnerScore: 3,332Success
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:303,28036,292,50927,225,000020,480
2Oct 14, 2026 08:303,28136,094,19527,239,000020,480
3Oct 14, 2026 08:303,29336,187,25327,340,000020,480
4Oct 14, 2026 08:303,32636,412,33027,613,000020,480
5Oct 14, 2026 08:303,33236,537,96827,658,000020,480
6Oct 14, 2026 08:303,47237,612,09828,822,000020,480
7Oct 14, 2026 08:303,47738,443,38128,865,000020,480
8Oct 14, 2026 08:303,48238,429,91728,903,000020,480
9Oct 14, 2026 08:303,52538,844,65229,261,000020,480