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 08:42highload-churnerhighload-churnerScore: 60,255Success
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 08:4260,078507,632,518498,652,000024,576stderr
2Oct 13, 2026 08:4260,113508,176,692497,929,0001,010,00024,576stderr
3Oct 13, 2026 08:4260,160508,394,333498,275,0001,059,00024,576stderr
4Oct 13, 2026 08:4260,240509,382,173499,994,000024,576stderr
5Oct 13, 2026 08:4260,255509,549,597500,123,000024,576stderr
6Oct 13, 2026 08:4260,337510,297,961499,793,0001,012,00024,576stderr
7Oct 13, 2026 08:4260,346510,375,806499,846,0001,026,00024,576stderr
8Oct 13, 2026 08:4260,427511,012,312501,546,000024,576stderr
9Oct 13, 2026 08:4260,550512,000,380502,570,000024,576stderr