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 20, 2026 20:50Pavel KrajcevskiPavel KrajcevskiScore: 57,130Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 20:5457,096485,004,148469,572,0004,331,0002,134,016
2May 20, 2026 20:5457,096485,969,797469,893,0004,008,0002,134,016
3May 20, 2026 20:5457,116485,942,437470,067,0004,001,0002,134,016
4May 20, 2026 20:5457,126486,071,040469,802,0004,348,0002,134,016
5May 20, 2026 20:5457,130486,640,250470,189,0003,996,0002,134,016
6May 20, 2026 20:5457,142486,624,185472,162,0002,117,0002,134,016
7May 20, 2026 20:5457,153486,074,335470,356,0004,015,0002,134,016
8May 20, 2026 20:5457,180486,791,092470,275,0004,320,0002,134,016
9May 20, 2026 20:5457,186486,613,889470,644,0004,002,0002,134,016