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 15:28highload-churnerhighload-churnerScore: 3,195Success
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 15:283,18436,827,54626,428,000020,480
2Oct 14, 2026 15:283,18635,963,10026,450,000020,480
3Oct 14, 2026 15:283,18835,450,24426,462,000020,480
4Oct 14, 2026 15:283,19335,460,71326,509,000020,480
5Oct 14, 2026 15:283,19536,072,09626,525,000020,480
6Oct 14, 2026 15:283,19635,456,83026,531,000020,480
7Oct 14, 2026 15:283,19735,580,38726,539,000020,480
8Oct 14, 2026 15:283,19835,520,28426,548,000020,480
9Oct 14, 2026 15:283,20035,484,89026,560,000020,480