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 07:21Josu San MartinJosu San MartinScore: 3,061Success
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 07:233,03634,831,84723,856,0001,040,0002,121,728stderr
2Sep 4, 2026 07:233,05034,948,60923,967,0001,046,0002,121,728stderr
3Sep 4, 2026 07:233,06035,153,83924,069,0001,025,0002,121,728stderr
4Sep 4, 2026 07:233,06135,078,81324,075,0001,027,0002,121,728stderr
5Sep 4, 2026 07:233,06134,983,34624,054,0001,051,0002,121,728stderr
6Sep 4, 2026 07:233,08835,444,51024,300,0001,028,0002,121,728stderr
7Sep 4, 2026 07:233,14835,771,16524,764,0001,050,0002,121,728stderr
8Sep 4, 2026 07:2315,234134,868,209123,897,0001,028,0002,121,728stderr
9Sep 4, 2026 07:2315,308135,467,721124,501,0001,027,0002,121,728stderr