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 02:52highload-churnerhighload-churnerScore: 26,383Success
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 02:5326,257226,874,186216,911,0001,023,0002,117,632stderr
2Oct 13, 2026 02:5326,268227,078,184216,954,0001,075,0002,117,632stderr
3Oct 13, 2026 02:5326,356229,791,552217,717,0001,044,0002,117,632stderr
4Oct 13, 2026 02:5326,360227,749,911217,765,0001,027,0002,117,632stderr
5Oct 13, 2026 02:5326,383227,964,229217,975,0001,005,0002,117,632stderr
6Oct 13, 2026 02:5326,383228,439,762217,979,0001,001,0002,117,632stderr
7Oct 13, 2026 02:5326,388228,117,469217,967,0001,058,0002,117,632stderr
8Oct 13, 2026 02:5326,433228,377,230218,390,0001,005,0002,117,632stderr
9Oct 13, 2026 02:5326,633230,550,382220,054,0001,005,0002,117,632stderr