Median Sergey Svistunov

Find the median of a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listOct 31, 2021 10:26Ilya AniskovetsIlya AniskovetsScore: 29,042Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2021 10:2828,081289,474,785230,262,63502,269,184
2Oct 31, 2021 10:2628,447291,800,963233,265,95102,273,280
3Oct 31, 2021 10:2828,641317,988,254234,856,57402,277,376
4Oct 31, 2021 10:2829,042295,387,460238,148,36802,273,280
5Oct 31, 2021 10:2629,205299,932,271239,476,97202,281,472
6Oct 31, 2021 10:2631,229326,063,803256,076,49902,260,992