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 listJun 28, 2026 13:33Shikhar SoniShikhar SoniScore: 4,824Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 13:334,73848,785,07137,836,0001,021,0002,113,536
2Jun 28, 2026 13:334,76048,516,09338,013,0001,020,0002,113,536
3Jun 28, 2026 13:334,79349,232,28438,282,0001,021,0002,113,536
4Jun 28, 2026 13:334,80349,332,24538,365,0001,022,0002,113,536
5Jun 28, 2026 13:334,82449,116,69438,543,0001,021,0002,113,536
6Jun 28, 2026 13:334,84049,258,70738,675,0001,021,0002,113,536
7Jun 28, 2026 13:334,84549,324,39538,711,0001,023,0002,113,536
8Jun 28, 2026 13:334,91049,715,73339,240,0001,023,0002,113,536
9Jun 28, 2026 13:3343,327365,369,664353,218,0002,065,0002,113,536