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 12, 2026 15:11highload-churnerhighload-churnerScore: 3,314Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 15:123,30036,373,51327,395,000020,480
2Oct 12, 2026 15:123,30236,387,51227,414,000020,480
3Oct 12, 2026 15:123,30436,401,63427,429,000020,480
4Oct 12, 2026 15:123,31336,487,19927,500,000020,480
5Oct 12, 2026 15:123,31439,720,79626,507,0001,003,00020,480
6Oct 12, 2026 15:123,32336,563,99226,572,0001,010,00020,480
7Oct 12, 2026 15:123,42737,421,75228,449,000020,480
8Oct 12, 2026 15:123,49238,373,50528,985,000020,480
9Oct 12, 2026 15:123,50738,229,19429,114,000020,480