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 listAug 2, 2022 12:32Elvir CrnčevićElvir CrnčevićScore: 1,644,236Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2023 11:011,640,86513,693,470,93413,619,182,81802,244,608
2Jul 18, 2023 11:011,641,27613,685,899,52613,622,594,61302,256,896
3Aug 2, 2022 12:321,642,85213,701,241,10613,635,671,29802,252,800
4Aug 2, 2022 12:321,644,23613,724,458,92813,647,159,22002,256,896
5Aug 2, 2022 12:321,653,54313,785,749,03413,724,410,81102,248,704
6Jul 18, 2023 11:011,686,61114,056,372,97113,998,874,00902,248,704