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 listDec 25, 2024 00:20Joad NacerJoad NacerScore: 2,323,375Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 25, 2024 00:202,308,21418,964,032,9179,152,338,0009,775,020,0002,277,376
2Dec 25, 2024 00:202,323,37519,093,941,4489,269,003,0009,782,671,0002,293,760
3Dec 25, 2024 00:202,334,06419,174,235,0809,328,286,0009,811,042,0002,301,952