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 listJan 7, 2026 07:40Rajarshi BasuRajarshi BasuScore: 73,361Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 07:403,98663,732,31331,662,0001,021,0002,420,736
2Jan 7, 2026 07:4070,278603,139,506459,429,000116,854,0002,519,040
3Jan 7, 2026 07:4070,389604,311,037453,148,000124,040,0002,420,736
4Jan 7, 2026 07:4072,310620,866,306464,953,000127,987,0002,519,040
5Jan 7, 2026 07:4073,361628,942,308483,645,000117,913,0002,347,008
6Jan 7, 2026 07:4084,936724,647,162575,566,000120,908,0002,285,568
7Jan 7, 2026 07:4086,836744,826,653589,222,000122,837,0002,322,432
8Jan 7, 2026 07:4087,855750,053,902600,509,000119,902,0002,301,952
9Jan 7, 2026 07:4090,637768,303,764625,345,000117,876,0002,379,776