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 listJan 17, 2023 21:11Kevin HeaveyKevin HeaveyScore: 138,696Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2023 21:12138,6091,216,781,8021,150,455,03202,215,936
2Jan 17, 2023 21:11138,6361,220,052,1801,150,677,97802,224,128
3Jan 17, 2023 21:11138,6681,213,140,8541,150,943,42002,220,032
4Jan 17, 2023 21:11138,6751,222,369,9931,151,000,59802,224,128
5Jan 17, 2023 21:12138,6961,217,856,6771,151,180,76002,260,992
6Jan 17, 2023 21:11138,6981,222,731,4301,151,197,02002,224,128
7Jan 17, 2023 21:11138,9861,210,947,8981,153,579,68302,232,320
8Jan 17, 2023 21:12139,3201,234,988,8391,156,357,75102,224,128
9Jan 17, 2023 21:11139,3831,225,979,9911,156,882,88802,215,936