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 18, 2026 10:40Charles CabergsCharles CabergsScore: 12,975Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 10:4012,656132,595,82896,796,0006,985,0002,363,392
2Apr 18, 2026 10:4012,826129,937,64097,158,0008,013,0002,506,752
3Apr 18, 2026 10:4012,908132,157,646101,851,0003,994,0002,461,696
4Apr 18, 2026 10:4012,910133,481,98299,868,0005,992,0002,502,656
5Apr 18, 2026 10:4012,975128,820,135104,385,0002,007,0002,433,024
6Apr 18, 2026 10:4013,020134,743,813103,775,0002,993,0002,408,448
7Apr 18, 2026 10:4013,022142,783,637105,780,000997,0002,502,656
8Apr 18, 2026 10:4013,027135,048,317102,794,0004,031,0002,502,656
9Apr 18, 2026 10:4013,111132,571,698106,505,0001,004,0002,437,120