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 25, 2025 21:42Adam FolwarcznyAdam FolwarcznyScore: 12,534Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2025 21:4212,523123,539,736100,940,0002,998,0002,461,696
2Aug 25, 2025 21:4212,531126,163,420101,009,0003,000,0002,441,216
3Aug 25, 2025 21:4212,532125,919,645101,012,0003,000,0002,400,256
4Aug 25, 2025 21:4212,532130,245,185101,016,0003,000,0002,400,256
5Aug 25, 2025 21:4212,534128,203,396102,031,0002,000,0002,400,256
6Aug 25, 2025 21:4212,535126,871,710101,040,0003,001,0002,400,256
7Aug 25, 2025 21:4212,539122,908,586101,073,0003,002,0002,449,408
8Aug 25, 2025 21:4212,541125,503,934102,092,0002,001,0002,457,600
9Aug 25, 2025 21:4212,545126,942,796102,119,0002,002,0002,400,256