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 11:45highload-churnerhighload-churnerScore: 3,263Success
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 11:453,24836,545,33026,963,000020,480
2Oct 14, 2026 11:453,25436,028,02727,014,000020,480
3Oct 14, 2026 11:453,25536,106,35927,018,000020,480
4Oct 14, 2026 11:453,26036,163,74127,061,000020,480
5Oct 14, 2026 11:453,26336,424,31227,089,000020,480
6Oct 14, 2026 11:453,26536,135,35527,103,000020,480
7Oct 14, 2026 11:453,26836,115,69927,132,000020,480
8Oct 14, 2026 11:453,27036,119,01127,143,000020,480
9Oct 14, 2026 11:453,27136,197,58627,157,000020,480