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 4, 2026 06:31Josu San MartinJosu San MartinScore: 3,070Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 06:313,04635,698,63823,953,0001,025,0002,121,728stderr
2Sep 4, 2026 06:313,05235,742,99123,974,0001,054,0002,121,728stderr
3Sep 4, 2026 06:313,06235,024,78124,083,0001,030,0002,121,728stderr
4Sep 4, 2026 06:313,06635,844,00924,124,0001,025,0002,121,728stderr
5Sep 4, 2026 06:313,07035,890,62124,152,0001,030,0002,121,728stderr
6Sep 4, 2026 06:313,07935,490,40424,223,0001,027,0002,121,728stderr
7Sep 4, 2026 06:313,09236,035,59124,302,0001,054,0002,121,728stderr
8Sep 4, 2026 06:3115,254135,878,122124,077,0001,006,0002,121,728stderr
9Sep 4, 2026 06:3115,258135,825,368124,088,0001,029,0002,121,728stderr