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 11, 2024 14:34Dmitrii KravchenkoDmitrii KravchenkoScore: 83,930Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2024 14:3483,415715,523,031493,535,000198,812,0002,326,528
2Sep 11, 2024 14:3483,525718,719,011495,467,000197,787,0002,420,736
3Sep 11, 2024 14:3483,620722,227,245495,318,000198,726,0002,351,104
4Sep 11, 2024 14:3483,727724,274,993495,956,000198,982,0002,338,816
5Sep 11, 2024 14:3483,930718,755,291494,730,000201,890,0002,306,048
6Sep 11, 2024 14:3483,944724,190,856494,810,000201,922,0002,396,160
7Sep 11, 2024 14:3484,187728,156,685494,823,000203,927,0002,478,080
8Sep 11, 2024 14:3484,478735,440,312493,413,000207,753,0002,473,984
9Sep 11, 2024 14:3485,002734,076,619495,662,000209,856,0002,408,448