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 22, 2024 13:27AnupamAnupamScore: 1,647,355Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2024 13:271,645,61313,723,967,62513,658,591,24202,260,992
2May 22, 2024 13:411,645,92513,716,922,65113,661,173,40102,256,896
3May 22, 2024 13:411,646,13913,724,285,71813,662,957,47702,265,088
4May 22, 2024 13:271,647,35513,747,046,56713,673,048,90202,269,184
5May 22, 2024 13:411,653,42413,787,773,85913,723,417,56102,248,704
6May 22, 2024 13:271,653,67813,784,345,93013,725,527,79502,244,608