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 12:21highload-churnerhighload-churnerScore: 3,246Success
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 12:213,23936,002,83826,889,000024,576stderr
2Oct 14, 2026 12:213,23936,418,43826,890,000024,576stderr
3Oct 14, 2026 12:213,24236,539,33526,909,000024,576stderr
4Oct 14, 2026 12:213,24435,959,68826,932,000024,576stderr
5Oct 14, 2026 12:213,24635,934,47026,950,000024,576stderr
6Oct 14, 2026 12:213,24835,934,25426,960,000024,576stderr
7Oct 14, 2026 12:213,25236,493,76926,995,000024,576stderr
8Oct 14, 2026 12:213,25935,992,67927,055,000024,576stderr
9Oct 14, 2026 12:213,25936,675,28627,050,000024,576stderr