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 listAug 15, 2026 00:34Tomislav TunkovicTomislav TunkovicScore: 2,684Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 00:352,66930,932,70220,770,0001,120,0002,113,536
2Aug 15, 2026 00:352,67530,507,32420,824,0001,119,0002,113,536
3Aug 15, 2026 00:352,67530,494,18720,814,0001,125,0002,113,536
4Aug 15, 2026 00:352,68230,517,00720,973,0001,020,0002,113,536
5Aug 15, 2026 00:352,68430,511,92420,889,0001,122,0002,113,536
6Aug 15, 2026 00:352,68530,264,93320,997,0001,028,0002,113,536
7Aug 15, 2026 00:352,68831,070,11920,926,0001,116,0002,113,536
8Aug 15, 2026 00:352,69130,579,14721,044,0001,024,0002,113,536
9Aug 15, 2026 00:355,40752,824,69543,265,0001,075,0002,113,536