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 2, 2026 23:05Karthik ReddyKarthik ReddyScore: 29,225Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 23:072,9336,033,318,70223,001,0001,054,00020,480
2Oct 2, 2026 23:073,0216,035,463,07523,628,0001,150,00020,480
3Oct 2, 2026 23:073,0366,034,187,31023,822,0001,081,00020,480
4Oct 2, 2026 23:0729,1496,248,316,235237,928,0001,097,00020,480
5Oct 2, 2026 23:0729,2256,248,891,226238,637,0001,008,00020,480
6Oct 2, 2026 23:0729,7226,252,969,856242,584,0001,142,00020,480
7Oct 2, 2026 23:0729,9046,254,489,599244,216,0001,001,00020,480
8Oct 2, 2026 23:0730,0086,255,301,992244,916,0001,150,00020,480
9Oct 2, 2026 23:0730,8166,262,046,297251,588,0001,110,00020,480