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 20:21xxScore: 62,219Success
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 20:2162,055579,681,912515,053,18802,293,760
2Jun 29, 2021 20:2162,104578,275,600515,461,99302,281,472
3Jun 29, 2021 20:2062,106578,556,146515,479,22902,281,472
4Jun 29, 2021 20:2162,155581,479,027515,890,21302,273,280
5Jun 29, 2021 20:2062,219573,069,554516,418,97002,277,376
6Jun 29, 2021 20:2062,387585,402,004517,808,91202,289,664
7Jun 29, 2021 20:2162,448567,416,798518,314,68102,281,472
8Jun 29, 2021 20:2162,879577,316,754521,894,72202,277,376
9Jun 29, 2021 20:2163,118585,848,081523,882,19602,293,760