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 listSep 1, 2023 22:10Ignas BagdonasIgnas BagdonasScore: 18,407Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2023 22:1018,300227,412,555151,887,07402,281,472
2Sep 1, 2023 22:1018,326218,899,225152,109,43102,285,568
3Sep 1, 2023 22:1018,335218,210,745152,176,58702,293,760
4Sep 1, 2023 22:1018,377184,512,881149,521,0003,010,0002,531,328
5Sep 1, 2023 22:1018,385177,997,419151,593,0001,003,0002,273,280
6Sep 1, 2023 22:1018,405180,947,710150,763,0001,996,0002,273,280
7Sep 1, 2023 22:1018,407183,378,890148,787,0003,994,0002,273,280
8Sep 1, 2023 22:1018,409179,488,157150,794,0001,997,0002,273,280
9Sep 1, 2023 22:1018,409180,774,657151,800,000998,0002,273,280
10Sep 1, 2023 22:1018,528179,311,285152,788,000998,0002,273,280
11Sep 1, 2023 22:1018,555179,709,220152,005,0002,000,0002,265,088
12Sep 1, 2023 22:1018,570178,104,709152,129,0002,001,0002,273,280