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 1, 2021 00:19Yuriy LyfenkoYuriy LyfenkoScore: 13,030Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2021 00:1913,022383,150,877106,082,0002,001,0002,260,992
2Jul 1, 2021 00:1913,024383,713,971106,098,0002,001,0002,387,968
3Jul 1, 2021 00:1913,027386,579,642106,122,0002,002,0002,260,992
4Jul 1, 2021 00:1913,028384,953,716106,130,0002,002,0002,260,992
5Jul 1, 2021 00:1913,030381,188,872108,148,00002,260,992
6Jul 1, 2021 00:1913,030379,676,684106,143,0002,002,0002,260,992
7Jul 1, 2021 00:1913,030397,759,972106,148,0002,002,0002,523,136
8Jul 1, 2021 00:1913,043384,186,961107,251,0001,002,0002,260,992
9Jul 1, 2021 00:1913,055389,186,949106,368,0001,988,0002,260,992
10Jul 1, 2021 00:1913,269417,587,604110,130,80302,244,608
11Jul 1, 2021 00:1913,278420,217,957110,207,82602,269,184
12Jul 1, 2021 00:1913,283417,132,308110,249,15402,240,512