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 18, 2026 01:49Andrew EpsteinAndrew EpsteinScore: 5,011Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 18, 2026 01:564,89348,957,44038,124,0002,005,00020,480
2Sep 18, 2026 01:564,96349,552,17838,673,0002,025,00020,480
3Sep 18, 2026 01:564,96450,159,64738,671,0002,040,00020,480
4Sep 18, 2026 01:564,99249,888,28138,814,0002,123,00020,480
5Sep 18, 2026 01:565,01150,539,90238,992,0002,104,00020,480
6Sep 18, 2026 01:565,04450,810,67339,270,0002,097,00020,480
7Sep 18, 2026 01:565,14050,954,94439,961,0002,187,00020,480
8Sep 18, 2026 01:565,16851,186,58640,361,0002,024,00020,480
9Sep 18, 2026 01:565,22952,431,10440,851,0002,029,00020,480