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 16, 2026 23:11Tomislav TunkovicTomislav TunkovicScore: 2,695Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 04:262,68530,218,68220,896,0001,126,0002,113,536
2Aug 17, 2026 04:262,68630,121,15220,922,0001,111,0002,113,536
3Aug 17, 2026 04:262,69130,350,21720,941,0001,126,0002,113,536
4Aug 17, 2026 04:262,69430,337,10321,028,0001,067,0002,113,536
5Aug 17, 2026 04:262,69530,342,89320,986,0001,118,0002,113,536
6Aug 17, 2026 04:262,70230,427,53421,134,0001,027,0002,113,536
7Aug 17, 2026 04:262,71230,501,61921,212,0001,031,0002,113,536
8Aug 17, 2026 04:262,77030,944,08821,591,0001,127,0002,113,536
9Aug 17, 2026 04:265,68754,878,45845,554,0001,080,0002,113,536