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 10:02highload-churnerhighload-churnerScore: 25,267Success
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 10:0325,177217,784,782208,974,000024,576stderr
2Oct 13, 2026 10:0325,191218,024,167209,087,000024,576stderr
3Oct 13, 2026 10:0325,230218,296,880209,410,000024,576stderr
4Oct 13, 2026 10:0325,257218,524,440209,637,000024,576stderr
5Oct 13, 2026 10:0325,267218,600,409208,714,0001,008,00024,576stderr
6Oct 13, 2026 10:0325,281218,675,167209,833,000024,576stderr
7Oct 13, 2026 10:0325,290218,773,773209,911,000024,576stderr
8Oct 13, 2026 10:0325,306219,506,274209,015,0001,031,00024,576stderr
9Oct 13, 2026 10:0325,321219,367,663209,121,0001,044,00024,576stderr