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 listApr 20, 2026 15:06BenBenScore: 48,639Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 15:0747,946413,518,248213,546,000179,618,0002,502,656
2Apr 20, 2026 15:0748,639427,502,766210,918,000187,927,0002,416,640
3Apr 20, 2026 15:0748,640424,609,762215,921,000182,933,0002,506,752