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:47Josu San MartinJosu San MartinScore: 3,079Success
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:483,04435,660,18623,942,0001,026,0002,121,728stderr
2Sep 4, 2026 06:483,04635,056,24123,960,0001,022,0002,121,728stderr
3Sep 4, 2026 06:483,06135,104,08324,080,0001,025,0002,121,728stderr
4Sep 4, 2026 06:483,07835,949,75524,192,0001,050,0002,121,728stderr
5Sep 4, 2026 06:483,07935,235,28724,230,0001,024,0002,121,728stderr
6Sep 4, 2026 06:483,08435,307,80024,272,0001,022,0002,121,728stderr
7Sep 4, 2026 06:483,09535,358,18924,352,0001,028,0002,121,728stderr
8Sep 4, 2026 06:4815,246134,938,459124,009,0001,010,0002,121,728stderr
9Sep 4, 2026 06:4815,260135,203,824124,129,0001,010,0002,121,728stderr