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:41highload-churnerhighload-churnerScore: 30,125Success
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:4229,953258,192,626247,523,0001,093,00024,576stderr
2Oct 14, 2026 12:4229,980257,853,530248,842,000024,576stderr
3Oct 14, 2026 12:4230,037264,867,992249,313,000024,576stderr
4Oct 14, 2026 12:4230,068258,634,336249,572,000024,576stderr
5Oct 14, 2026 12:4230,125259,528,687250,039,000024,576stderr
6Oct 14, 2026 12:4230,130259,634,643250,085,000024,576stderr
7Oct 14, 2026 12:4230,132259,253,795250,096,000024,576stderr
8Oct 14, 2026 12:4230,150259,774,715250,251,000024,576stderr
9Oct 14, 2026 12:4230,172259,375,963250,434,000024,576stderr