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 listMar 23, 2026 11:23Dominique GarmierDominique GarmierScore: 10,130Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 11:2310,076108,669,90481,619,0001,007,0002,306,048
2Mar 23, 2026 11:2310,092106,349,78680,761,0001,994,0002,420,736
3Mar 23, 2026 11:2310,093106,983,95980,768,0001,994,0002,273,280
4Mar 23, 2026 11:2310,096109,004,79480,790,0001,994,0002,392,064
5Mar 23, 2026 11:2310,130109,354,77180,061,0003,002,0002,351,104
6Mar 23, 2026 11:2310,130111,128,73680,064,0003,002,0002,506,752
7Mar 23, 2026 11:2310,145116,150,57180,183,0003,006,0002,293,760
8Mar 23, 2026 11:2310,158114,903,76380,288,0003,010,0002,293,760
9Mar 23, 2026 11:2310,168110,167,68181,392,0001,985,0002,273,280