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 18, 2025 05:11Ashish AhujaAshish AhujaScore: 12,842Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2025 05:1112,591128,576,18494,551,0009,952,0002,424,832
2Aug 18, 2025 05:1112,596133,618,00796,579,0007,965,0002,326,528
3Aug 18, 2025 05:1112,613130,566,36994,720,0009,970,0002,330,624
4Aug 18, 2025 05:1112,733134,324,87197,706,0007,976,0002,506,752
5Aug 18, 2025 05:1112,842140,299,72498,622,0007,969,0002,338,816
6Aug 18, 2025 05:1112,956135,901,82496,582,00010,952,0002,506,752
7Aug 18, 2025 05:1112,969129,160,44898,672,0008,970,0002,334,720
8Aug 18, 2025 05:1112,973138,617,532100,695,0006,978,0002,338,816
9Aug 18, 2025 05:1113,014135,326,785101,019,0007,001,0002,342,912