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 13, 2026 08:50highload-churnerhighload-churnerScore: 28,777Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 08:5128,648246,799,779236,748,0001,034,00024,576stderr
2Oct 13, 2026 08:5128,658246,781,541237,867,000024,576stderr
3Oct 13, 2026 08:5128,690247,546,873238,128,000024,576stderr
4Oct 13, 2026 08:5128,725247,322,733238,424,000024,576stderr
5Oct 13, 2026 08:5128,777250,372,173238,851,000024,576stderr
6Oct 13, 2026 08:5128,830248,290,082239,292,000024,576stderr
7Oct 13, 2026 08:5128,838248,882,156239,361,000024,576stderr
8Oct 13, 2026 08:5128,860248,972,661239,538,000024,576stderr
9Oct 13, 2026 08:5128,901249,385,496238,857,0001,024,00024,576stderr