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 listMay 23, 2026 00:04M-RochatM-RochatScore: 6,558Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2026 00:046,53063,594,09853,191,0001,016,0002,113,536
2May 23, 2026 00:046,53166,181,69753,172,0001,039,0002,113,536
3May 23, 2026 00:046,53965,410,14053,260,0001,016,0002,113,536
4May 23, 2026 00:046,55266,409,51653,356,0001,030,0002,113,536
5May 23, 2026 00:046,55866,594,37453,419,0001,016,0002,113,536
6May 23, 2026 00:046,58063,798,19953,601,0001,016,0002,113,536
7May 23, 2026 00:046,58165,602,09253,614,0001,016,0002,113,536
8May 23, 2026 00:046,61766,505,18853,908,0001,017,0002,113,536
9May 23, 2026 00:046,62264,810,86153,948,0001,018,0002,113,536