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:36Josu San MartinJosu San MartinScore: 3,058Success
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 00:573,02834,868,33323,806,0001,025,0002,121,728stderr
2Sep 5, 2026 00:573,03035,627,14423,828,0001,021,0002,121,728stderr
3Sep 5, 2026 00:573,03434,754,21123,859,0001,025,0002,121,728stderr
4Sep 5, 2026 00:573,05535,789,48724,027,0001,025,0002,121,728stderr
5Sep 5, 2026 00:573,05835,248,44124,050,0001,030,0002,121,728stderr
6Sep 5, 2026 00:573,06935,905,68624,139,0001,030,0002,121,728stderr
7Sep 5, 2026 00:5715,235135,214,866123,898,0001,034,0002,121,728stderr
8Sep 5, 2026 00:5715,240135,003,602123,963,0001,007,0002,121,728stderr
9Sep 5, 2026 00:5715,274136,935,410124,237,0001,014,0002,121,728stderr