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 14:40highload-churnerhighload-churnerScore: 21,763Success
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 14:4121,725189,339,546180,325,000024,576stderr
2Oct 14, 2026 14:4121,740190,218,468180,442,000024,576stderr
3Oct 14, 2026 14:4121,745189,942,301180,491,000024,576stderr
4Oct 14, 2026 14:4121,759190,130,514180,603,000024,576stderr
5Oct 14, 2026 14:4121,763190,096,655180,636,000024,576stderr
6Oct 14, 2026 14:4121,800190,078,003180,946,000024,576stderr
7Oct 14, 2026 14:4121,804190,362,123179,935,0001,040,00024,576stderr
8Oct 14, 2026 14:4121,813190,953,603181,051,000024,576stderr
9Oct 14, 2026 14:4121,848190,872,388180,306,0001,035,00024,576stderr