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 listJul 25, 2024 14:44matsuoka-601matsuoka-601Score: 20,156Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 25, 2024 14:4420,028227,788,780166,228,60002,289,664
2Jul 25, 2024 14:4420,028233,711,020166,235,02102,285,568
3Jul 25, 2024 14:4420,032227,569,580166,265,96402,289,664
4Jul 25, 2024 14:4420,139193,785,667165,152,0002,001,0002,281,472
5Jul 25, 2024 14:4420,149192,645,070166,233,0001,001,0002,281,472
6Jul 25, 2024 14:4420,152190,656,741165,260,0002,003,0002,265,088
7Jul 25, 2024 14:4420,156194,064,232167,292,00002,514,944
8Jul 25, 2024 14:4420,157193,998,580166,298,0001,001,0002,273,280
9Jul 25, 2024 14:4420,159189,737,829166,318,0001,001,0002,514,944
10Jul 25, 2024 14:4420,160192,390,924166,330,0001,001,0002,281,472
11Jul 25, 2024 14:4420,169192,501,256166,397,0001,002,0002,355,200
12Jul 25, 2024 14:4420,169191,180,118166,403,0001,002,0002,265,088