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 listSep 3, 2026 05:08Josu San MartinJosu San MartinScore: 11,034Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 05:093,57939,463,18828,301,0001,047,0002,113,536
2Sep 3, 2026 05:093,59139,536,28228,418,0001,033,0002,113,536
3Sep 3, 2026 05:099,47488,505,60373,640,0004,052,0002,113,536
4Sep 3, 2026 05:099,62288,850,11774,482,0004,421,0002,113,536
5Sep 3, 2026 05:0911,034100,574,71184,721,0005,759,0002,113,536
6Sep 3, 2026 05:0918,178159,083,093142,883,0006,179,0002,117,632
7Sep 3, 2026 05:0919,868173,017,322156,702,0006,218,0002,117,632
8Sep 3, 2026 05:0920,898181,410,616164,919,0006,452,0002,117,632
9Sep 3, 2026 05:0921,428185,788,426168,976,0006,735,0002,117,632