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 16, 2026 05:04Victor MerckléVictor MerckléScore: 6,956Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 05:096,94766,062,99156,665,0001,003,0002,113,536
2May 16, 2026 05:096,95266,410,40356,683,0001,022,0002,113,536
3May 16, 2026 05:096,95266,927,89656,664,0001,040,0002,113,536
4May 16, 2026 05:096,95567,087,13856,691,0001,038,0002,113,536
5May 16, 2026 05:096,95667,834,59256,736,0001,005,0002,113,536
6May 16, 2026 05:096,95767,459,33056,698,0001,049,0002,113,536
7May 16, 2026 05:096,95865,061,61256,739,0001,019,0002,113,536
8May 16, 2026 05:096,96467,628,73256,777,0001,025,0002,113,536
9May 16, 2026 05:097,08968,565,91457,796,0001,048,0002,113,536