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:57highload-churnerhighload-churnerScore: 22,286Success
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:5722,241193,657,329184,605,000024,576stderr
2Oct 14, 2026 12:5722,258194,241,858184,747,000024,576stderr
3Oct 14, 2026 12:5722,270194,330,303184,845,000024,576stderr
4Oct 14, 2026 12:5722,271193,812,195184,856,000024,576stderr
5Oct 14, 2026 12:5722,286195,051,944184,982,000024,576stderr
6Oct 14, 2026 12:5722,305194,139,884185,136,000024,576stderr
7Oct 14, 2026 12:5722,305194,148,677185,139,000024,576stderr
8Oct 14, 2026 12:5722,388194,960,837185,825,000024,576stderr
9Oct 14, 2026 12:5722,441199,616,431186,261,000024,576stderr