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 listDec 25, 2024 05:33mahdi739mahdi739Score: 49,165Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 25, 2024 05:3349,072431,006,785407,294,00002,285,568
2Dec 25, 2024 05:3349,149432,932,802405,939,0001,999,0002,285,568
3Dec 25, 2024 05:3349,151430,446,400405,951,0001,999,0002,285,568
4Dec 25, 2024 05:3349,156435,363,047405,997,0001,999,0002,367,488
5Dec 25, 2024 05:3349,165435,523,876407,068,0001,000,0002,285,568
6Dec 25, 2024 05:3349,173430,038,507408,132,00002,371,584
7Dec 25, 2024 05:3349,176430,349,097408,162,00002,469,888
8Dec 25, 2024 05:3349,181435,246,710408,205,00002,371,584
9Dec 25, 2024 05:3349,208435,258,267406,431,0001,997,0002,285,568