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 3, 2023 09:57Erdem KeskinErdem KeskinScore: 83,899Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2023 10:0383,888758,244,826696,270,00402,265,088
2Jul 3, 2023 10:0383,889755,009,139696,281,83202,232,320
3Jul 3, 2023 09:5783,899766,966,370696,363,36102,232,320
4Jul 3, 2023 10:0383,899748,559,077696,361,68102,236,416
5Jul 3, 2023 09:5783,969763,510,861696,946,71402,224,128
6Jul 3, 2023 09:5784,099753,580,106698,022,84902,236,416