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 listSep 25, 2026 03:29Karthik ReddyKarthik ReddyScore: 9,111Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2026 03:298,92084,417,83373,028,0001,013,0002,113,536
2Sep 25, 2026 03:299,03985,428,27074,017,0001,013,0002,113,536
3Sep 25, 2026 03:299,04785,546,02274,086,0001,012,0002,113,536
4Sep 25, 2026 03:299,08885,997,11974,419,0001,015,0002,113,536
5Sep 25, 2026 03:299,11186,109,18774,615,0001,014,0002,113,536
6Sep 25, 2026 03:299,13186,250,51874,782,0001,012,0002,113,536
7Sep 25, 2026 03:299,15086,398,63874,940,0001,013,0002,113,536
8Sep 25, 2026 03:299,18086,764,69875,186,0001,014,0002,113,536
9Sep 25, 2026 03:299,22086,955,93275,519,0001,013,0002,113,536