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:25highload-churnerhighload-churnerScore: 25,234Success
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:2525,125217,453,830208,541,000024,576stderr
2Oct 14, 2026 12:2525,131217,780,352208,590,000024,576stderr
3Oct 14, 2026 12:2525,187218,598,623208,028,0001,030,00024,576stderr
4Oct 14, 2026 12:2525,202220,235,677208,151,0001,033,00024,576stderr
5Oct 14, 2026 12:2525,234218,424,017208,433,0001,014,00024,576stderr
6Oct 14, 2026 12:2525,280218,820,243209,827,000024,576stderr
7Oct 14, 2026 12:2525,330219,760,511209,233,0001,010,00024,576stderr
8Oct 14, 2026 12:2525,342220,007,411210,341,000024,576stderr
9Oct 14, 2026 12:2525,353219,931,412209,426,0001,007,00024,576stderr