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 29, 2021 19:33xxError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2021 19:3000000Error: died or killed
2Jun 29, 2021 19:3100000Error: died or killed
3Jun 29, 2021 19:3100000Error: died or killed
4Jun 29, 2021 19:3200000Error: died or killed
5Jun 29, 2021 19:3300000Error: died or killed
6Jun 29, 2021 19:3166,197612,422,115549,436,57502,265,088
7Jun 29, 2021 19:3166,397619,487,011551,090,98302,265,088
8Jun 29, 2021 19:3166,516615,312,665552,083,25202,252,800
9Jun 29, 2021 19:3267,150611,662,076557,341,70202,260,992
10Jun 29, 2021 19:3267,173618,610,029557,535,02802,265,088
11Jun 29, 2021 19:3367,698624,640,179561,891,32002,244,608
12Jun 29, 2021 19:3267,834638,583,944563,022,91302,260,992
13Jun 29, 2021 19:3368,447637,622,994568,110,89602,260,992
14Jun 29, 2021 19:3368,637632,492,437569,691,03702,256,896