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 listSep 2, 2024 13:24Kevin HeaveyKevin HeaveyScore: 53,816Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2024 13:2453,582472,820,151442,735,0001,998,0002,285,568
2Sep 2, 2024 13:2453,796472,286,257445,506,000998,0002,375,680
3Sep 2, 2024 13:2453,815472,629,807445,665,000999,0002,281,472
4Sep 2, 2024 13:2453,816471,705,797445,671,000999,0002,285,568
5Sep 2, 2024 13:2453,867470,505,614445,094,0002,000,0002,285,568
6Sep 2, 2024 13:2453,906473,943,734447,423,00002,371,584