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 listNov 24, 2024 02:44MatthiasMatthiasScore: 8,496Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 24, 2024 02:448,450100,492,01869,133,0001,001,0002,367,488
2Nov 24, 2024 02:448,45397,010,83369,162,0001,002,0002,285,568
3Nov 24, 2024 02:448,47095,157,78968,293,0002,008,0002,265,088
4Nov 24, 2024 02:448,47095,461,08768,293,0002,008,0002,285,568
5Nov 24, 2024 02:448,47894,787,89869,361,0001,005,0002,285,568
6Nov 24, 2024 02:448,48093,746,24269,377,0001,005,0002,285,568
7Nov 24, 2024 02:448,49696,361,13669,506,0001,007,0002,273,280
8Nov 24, 2024 02:448,503102,071,72969,566,0001,008,0002,289,664
9Nov 24, 2024 02:448,50697,209,38869,589,0001,008,0002,281,472
10Nov 24, 2024 02:448,50799,569,04269,603,0001,008,0002,289,664
11Nov 24, 2024 02:448,507102,244,11969,599,0001,008,0002,289,664
12Nov 24, 2024 02:448,510103,503,22069,624,0001,009,0002,289,664