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 listMay 25, 2025 02:25Emanuele BolognesiEmanuele BolognesiScore: 112,264Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2025 02:2593,207792,877,837636,415,000127,882,0002,265,088
2May 25, 2025 02:25112,264942,626,670785,626,000134,935,0002,494,464
3May 25, 2025 02:25123,8221,044,725,801882,428,000132,913,0002,301,952