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 listFeb 7, 2026 04:17Josu San MartinJosu San MartinScore: 11,259Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 04:173,46356,158,93827,382,0001,014,0002,301,952
2Feb 7, 2026 04:173,49352,696,83328,642,00002,318,336
3Feb 7, 2026 04:1711,257115,699,13691,307,0001,003,0002,494,464
4Feb 7, 2026 04:1711,259121,913,88089,313,0003,010,0002,482,176
5Feb 7, 2026 04:1711,281118,076,51191,503,0001,005,0002,387,968
6Feb 7, 2026 04:1711,304121,206,73591,693,000996,0002,273,280