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:19highload-churnerhighload-churnerScore: 22,730Success
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:1922,658196,978,268187,057,0001,011,0002,117,632stderr
2Oct 13, 2026 02:1922,670199,654,812187,132,0001,032,0002,117,632stderr
3Oct 13, 2026 02:1922,684197,337,978187,252,0001,032,0002,117,632stderr
4Oct 13, 2026 02:1922,722197,553,041187,576,0001,017,0002,117,632stderr
5Oct 13, 2026 02:1922,730198,168,096187,645,0001,021,0002,117,632stderr
6Oct 13, 2026 02:1922,761198,382,387187,866,0001,053,0002,117,632stderr
7Oct 13, 2026 02:1922,821198,907,920188,408,0001,011,0002,117,632stderr
8Oct 13, 2026 02:1922,938199,915,563189,373,0001,017,0002,117,632stderr
9Oct 13, 2026 02:1922,979199,726,902189,717,0001,011,0002,117,632stderr