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 listAug 14, 2026 18:43marko1597marko1597Score: 3,948Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 11:43Tomislav Tunkovic10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 18:483,84439,753,43730,488,0001,035,0002,121,728stderr
2Aug 14, 2026 18:483,85239,840,38730,572,0001,021,0002,121,728stderr
3Aug 14, 2026 18:483,88540,172,34830,838,0001,023,0002,121,728stderr
4Aug 14, 2026 18:483,91040,257,45131,022,0001,041,0002,121,728stderr
5Aug 14, 2026 18:483,94840,589,47731,338,0001,038,0002,121,728stderr
6Aug 14, 2026 18:483,98441,143,94531,642,0001,028,0002,121,728stderr
7Aug 14, 2026 18:483,98941,075,57331,670,0001,047,0002,121,728stderr
8Aug 14, 2026 18:484,04041,291,81532,093,0001,041,0002,121,728stderr
9Aug 14, 2026 18:4812,986114,696,483100,848,0005,642,0002,121,728stderr