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 29, 2026 16:22Josu San MartinJosu San MartinScore: 5,021Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 16:274,99149,849,43540,377,0001,051,0002,113,536
2Aug 29, 2026 16:274,99249,833,87540,380,0001,055,0002,113,536
3Aug 29, 2026 16:275,02050,141,78940,544,0001,126,0002,113,536
4Aug 29, 2026 16:275,02150,070,52040,570,0001,107,0002,113,536
5Aug 29, 2026 16:275,02150,062,64440,555,0001,125,0002,113,536
6Aug 29, 2026 16:275,02250,049,04440,575,0001,108,0002,113,536
7Aug 29, 2026 16:275,02250,087,92840,563,0001,123,0002,113,536
8Aug 29, 2026 16:275,02650,171,48140,614,0001,106,0002,113,536
9Aug 29, 2026 16:275,04350,223,37040,828,0001,030,0002,113,536