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 listOct 7, 2023 21:19Serge SmirnovSerge SmirnovScore: 43,824Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 7, 2023 21:2443,810438,869,052363,621,69002,285,568
2Oct 7, 2023 21:1943,812428,121,025363,643,36202,281,472
3Oct 7, 2023 21:2043,818425,153,452363,687,67002,289,664
4Oct 7, 2023 21:2043,821435,707,721363,714,25402,285,568
5Oct 7, 2023 21:2443,824427,230,472363,741,93902,281,472
6Oct 7, 2023 21:2443,825434,341,251363,750,24102,289,664
7Oct 7, 2023 21:1943,826423,892,791363,752,52302,281,472
8Oct 7, 2023 21:2043,827435,348,336363,763,24302,293,760
9Oct 7, 2023 21:1943,841427,850,794363,883,97902,289,664