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 22, 2026 16:44Charles CabergsCharles CabergsScore: 5,778Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 16:455,66663,467,01042,425,0004,040,0002,351,104
2Apr 22, 2026 16:455,69762,367,87944,688,0002,031,0002,400,256
3Apr 22, 2026 16:455,71565,802,59944,874,0001,994,0002,375,680
4Apr 22, 2026 16:455,73863,652,11841,051,0006,007,0002,334,720
5Apr 22, 2026 16:455,77861,227,66746,372,0001,008,0002,371,584
6Apr 22, 2026 16:455,80066,801,98745,539,0002,023,0002,543,616
7Apr 22, 2026 16:455,81061,135,14445,615,0002,027,0002,551,808
8Apr 22, 2026 16:455,84463,853,91943,934,0003,994,0002,338,816
9Apr 22, 2026 16:455,89064,773,76144,274,0004,024,0002,326,528