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 19, 2026 15:40Andrew EpsteinAndrew EpsteinScore: 17,197Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 15:412,73231,155,11621,400,0001,007,00020,480
2Sep 19, 2026 15:412,73831,882,92321,401,0001,058,00020,480
3Sep 19, 2026 15:412,74631,381,40821,456,0001,068,00020,480
4Sep 19, 2026 15:412,75331,895,14921,493,0001,086,00020,480
5Sep 19, 2026 15:4117,197149,793,616139,989,0001,027,00020,480
6Sep 19, 2026 15:4117,266150,368,634140,587,0001,002,00020,480
7Sep 19, 2026 15:4118,236158,434,601148,518,0001,025,00020,480
8Sep 19, 2026 15:4118,356159,333,995149,496,0001,027,00020,480
9Sep 19, 2026 15:4118,420159,773,441150,045,0001,005,00020,480