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:02Dmitrii KravchenkoDmitrii KravchenkoScore: 91,046Success
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:0290,481778,084,392533,282,000217,707,0002,383,872
2Sep 11, 2024 14:0290,509777,079,527520,465,000230,763,0002,326,528
3Sep 11, 2024 14:0290,765777,895,049536,539,000216,813,0002,498,560
4Sep 11, 2024 14:0290,805777,438,527538,774,000214,910,0002,387,968
5Sep 11, 2024 14:0291,046777,983,251528,780,000226,905,0002,383,872
6Sep 11, 2024 14:0291,102781,636,207533,398,000222,748,0002,293,760
7Sep 11, 2024 14:0291,124782,603,095534,524,000221,802,0002,469,888
8Sep 11, 2024 14:0291,146782,922,244538,651,000217,858,0002,498,560
9Sep 11, 2024 14:0291,735785,331,928533,581,000227,821,0002,387,968