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 5, 2026 00:40Josu San MartinJosu San MartinScore: 3,053Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 01:073,02034,770,99023,729,0001,036,0002,121,728stderr
2Sep 5, 2026 01:073,03834,829,47523,892,0001,025,0002,121,728stderr
3Sep 5, 2026 01:073,04234,852,98023,926,0001,025,0002,121,728stderr
4Sep 5, 2026 01:073,04935,227,90223,980,0001,029,0002,121,728stderr
5Sep 5, 2026 01:073,05335,784,87424,013,0001,025,0002,121,728stderr
6Sep 5, 2026 01:073,05835,792,10824,056,0001,025,0002,121,728stderr
7Sep 5, 2026 01:0715,224135,720,342123,833,0001,006,0002,121,728stderr
8Sep 5, 2026 01:0715,239134,953,808123,947,0001,015,0002,121,728stderr
9Sep 5, 2026 01:0715,253135,112,433123,970,0001,109,0002,121,728stderr