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 listSep 28, 2023 13:27apuxbtapuxbtScore: 297,714Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2023 13:26283,67413,443,561,0302,326,128,91302,228,224
2Sep 28, 2023 13:30286,37912,371,652,8562,348,305,22202,256,896
3Sep 28, 2023 13:27292,44113,990,908,9342,398,013,87702,277,376
4Sep 28, 2023 13:26293,64213,592,024,7762,407,861,70502,252,800
5Sep 28, 2023 13:30297,71412,437,464,9692,441,255,88802,277,376
6Sep 28, 2023 13:26297,96714,437,519,9562,443,332,31802,232,320
7Sep 28, 2023 13:27304,84915,053,329,8822,499,758,25202,191,360
8Sep 28, 2023 13:30305,11214,467,263,9132,501,920,08302,232,320
9Sep 28, 2023 13:27314,34414,465,607,4402,577,624,30102,248,704