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 23, 2024 14:38E SequeiraE SequeiraScore: 13,355Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 23, 2024 14:3813,347138,274,448108,786,0001,996,0002,465,792
2Nov 23, 2024 14:3813,347138,827,442108,785,0001,996,0002,289,664
3Nov 23, 2024 14:3813,349140,318,163108,797,0001,996,0002,289,664
4Nov 23, 2024 14:3813,355138,191,957108,852,0001,997,0002,289,664
5Nov 23, 2024 14:3813,355141,663,404108,847,0001,997,0002,289,664
6Nov 23, 2024 14:3813,358137,316,542108,875,0001,997,0002,289,664
7Nov 23, 2024 14:3813,360138,624,883108,894,0001,998,0002,289,664
8Nov 23, 2024 14:3813,363138,897,567109,911,000999,0002,478,080
9Nov 23, 2024 14:3813,368136,414,511108,952,0001,999,0002,289,664