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 listOct 3, 2026 00:54Karthik ReddyKarthik ReddyScore: 2,675Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 3, 2026 00:552,49629,531,32120,471,000020,480
2Oct 3, 2026 00:552,56130,105,89919,982,0001,025,00020,480
3Oct 3, 2026 00:552,59830,339,67320,105,0001,205,00020,480
4Oct 3, 2026 00:552,66930,831,68320,290,0001,598,00020,480
5Oct 3, 2026 00:552,67530,875,31220,330,0001,611,00020,480
6Oct 3, 2026 00:552,68831,129,51520,324,0001,720,00020,480
7Oct 3, 2026 00:552,72231,362,89420,337,0001,988,00020,480
8Oct 3, 2026 00:552,92432,897,68119,683,0004,299,00020,480
9Oct 3, 2026 00:552,93033,044,17119,710,0004,319,00020,480