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 listNov 5, 2024 21:32CheranMahalingamCheranMahalingamScore: 1,823,587Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2024 21:321,819,74515,141,829,86515,015,922,00087,958,0002,289,664
2Nov 5, 2024 21:321,822,21315,161,736,89815,060,394,00063,976,0002,281,472
3Nov 5, 2024 21:321,822,36015,154,555,94515,058,619,00066,971,0002,281,472
4Nov 5, 2024 21:321,823,44515,164,813,70015,062,621,00071,969,0002,281,472
5Nov 5, 2024 21:321,823,58715,168,584,17215,067,806,00067,967,0002,289,664
6Nov 5, 2024 21:321,823,79015,165,402,48815,066,491,00070,969,0002,293,760
7Nov 5, 2024 21:321,823,86815,166,874,70715,065,142,00072,966,0002,281,472
8Nov 5, 2024 21:321,824,25715,170,771,94515,071,368,00069,964,0002,281,472
9Nov 5, 2024 21:321,824,36115,176,384,56315,075,227,00066,969,0002,281,472