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 18, 2025 14:01sheryllynn24sheryllynn24Score: 15,695Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 18, 2025 14:0115,671160,907,150128,065,0002,001,0002,277,376
2Sep 18, 2025 14:0115,679158,674,925127,130,0003,003,0002,277,376
3Sep 18, 2025 14:0115,688160,633,986129,213,0001,001,0002,277,376
4Sep 18, 2025 14:0115,692163,521,438126,239,0004,007,0002,277,376
5Sep 18, 2025 14:0115,695159,813,568126,259,0004,008,0002,277,376
6Sep 18, 2025 14:0115,697158,255,911129,287,0001,002,0002,519,040
7Sep 18, 2025 14:0115,700151,155,847126,305,0004,009,0002,277,376
8Sep 18, 2025 14:0115,730154,419,164129,551,0001,004,0002,519,040
9Sep 18, 2025 14:0115,763158,356,970128,835,0001,997,0002,277,376