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 8, 2024 07:05matsuoka-601matsuoka-601Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2024 07:0500000Error: No answer to stdout. Died or killed?
2Jun 8, 2024 07:0600000Error: No answer to stdout. Died or killed?
3Jun 8, 2024 07:0600000Error: expected "53690847399054811 ", got "82291782537052109"
4Jun 8, 2024 07:0700000Error: No answer to stdout. Died or killed?
5Jun 8, 2024 07:065,081100,057,24342,172,15602,248,704
6Jun 8, 2024 07:075,122105,088,22642,508,71202,248,704
7Jun 8, 2024 07:075,150128,068,30642,746,21402,260,992
8Jun 8, 2024 07:065,156109,568,51842,794,09202,260,992
9Jun 8, 2024 07:065,162101,240,13442,845,45102,256,896
10Jun 8, 2024 07:075,162117,991,86942,845,77402,256,896