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 listApr 27, 2026 22:01TudyMTudyMScore: 17,508Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 22:0817,390161,135,450140,608,0001,994,0002,379,776
2Apr 27, 2026 22:0817,431166,157,672140,941,0001,999,0002,375,680
3Apr 27, 2026 22:0817,495160,200,137143,460,00002,318,336
4Apr 27, 2026 22:0817,500161,192,659141,500,0002,007,0002,396,160
5Apr 27, 2026 22:0817,508163,335,858141,579,0001,994,0002,375,680
6Apr 27, 2026 22:0817,521162,545,951141,685,0001,995,0002,392,064
7Apr 27, 2026 22:0817,534162,403,817142,785,000998,0002,383,872
8Apr 27, 2026 22:0817,543160,527,531140,860,0002,997,0002,383,872
9Apr 27, 2026 22:0817,556160,016,245140,966,0002,999,0002,318,336