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 listMay 9, 2024 09:08titineotitineoScore: 1,646,377Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2024 09:011,646,00013,724,872,73113,661,797,92802,265,088
2May 9, 2024 09:011,646,21213,743,873,54013,663,560,97102,260,992
3May 9, 2024 09:081,646,25513,735,058,96813,663,919,59402,256,896
4May 9, 2024 09:081,646,37713,724,004,67213,664,931,53702,256,896
5May 9, 2024 09:081,646,39813,726,204,48013,665,103,23602,256,896
6May 9, 2024 09:011,652,67113,778,797,13613,717,168,99002,265,088