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 listAug 2, 2026 20:05George SeabridgeGeorge SeabridgeScore: 8,924Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 20:058,28078,644,77165,491,0003,233,0002,113,536
2Aug 2, 2026 20:058,32679,053,14565,942,0003,164,0002,113,536
3Aug 2, 2026 20:058,34979,225,79766,087,0003,214,0002,113,536
4Aug 2, 2026 20:058,38879,545,70866,358,0003,263,0002,113,536
5Aug 2, 2026 20:058,92483,973,57770,917,0003,155,0002,113,536
6Aug 2, 2026 20:059,95992,557,37979,565,0003,095,0002,113,536
7Aug 2, 2026 20:0511,186102,757,83689,703,0003,145,0002,113,536
8Aug 2, 2026 20:0513,630123,057,861110,006,0003,130,0002,113,536
9Aug 2, 2026 20:0537,068317,581,997304,437,0003,231,0002,113,536