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 26, 2023 21:23Kevin HeaveyKevin HeaveyScore: 50,540Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 26, 2023 21:2450,516485,034,416419,281,46702,281,472
2Jan 26, 2023 21:2450,523481,488,130419,339,08602,281,472
3Jan 26, 2023 21:2350,535482,252,261419,438,04602,289,664
4Jan 26, 2023 21:2450,540490,780,271419,484,69202,281,472
5Jan 26, 2023 21:2350,545488,473,993419,521,41902,277,376
6Jan 26, 2023 21:2350,551474,250,634419,577,20102,252,800