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 listJun 14, 2023 04:25Victor MuñozVictor MuñozScore: 31,240Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 14, 2023 04:2529,880312,081,185248,002,62202,265,088
2Jun 14, 2023 04:2529,979314,115,582248,828,64002,265,088
3Jun 14, 2023 04:2530,008315,341,059249,068,21702,273,280
4Jun 14, 2023 04:2531,129280,751,018257,371,0001,001,0002,387,968
5Jun 14, 2023 04:2531,200283,719,874256,965,0001,999,0002,265,088
6Jun 14, 2023 04:2531,206283,915,939257,010,0002,000,0002,269,184
7Jun 14, 2023 04:2531,240290,511,407258,290,0001,001,0002,260,992
8Jun 14, 2023 04:2531,244282,529,326258,322,0001,001,0002,265,088
9Jun 14, 2023 04:2531,263286,359,105259,485,00002,387,968
10Jun 14, 2023 04:2531,269289,792,420258,533,000998,0002,265,088
11Jun 14, 2023 04:2531,288289,216,706257,690,0001,997,0002,392,064
12Jun 14, 2023 04:2531,295286,048,095257,749,0001,998,0002,265,088