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 listJun 5, 2024 15:11PenguinGremlinPenguinGremlinScore: 1,765,285Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2024 15:111,599,40613,345,615,29413,275,073,72402,260,992
2Jun 22, 2024 13:431,603,20713,370,932,36513,306,614,94802,248,704
3Jun 22, 2024 13:431,603,55713,371,798,95813,309,524,67002,351,104
4Jun 22, 2024 13:431,765,28514,711,836,12014,651,868,32902,256,896
5Jun 5, 2024 15:111,766,94814,739,907,38414,665,668,71102,252,800
6Jun 5, 2024 15:111,767,47114,738,613,97114,670,008,45002,260,992