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 listApr 8, 2026 07:49olliecrowolliecrowScore: 3,573Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 8, 2026 07:493,56853,125,64528,248,0001,008,0002,306,048
2Apr 8, 2026 07:493,57361,538,42427,280,0002,020,0002,273,280
3Apr 8, 2026 07:4919,264184,136,467151,965,0005,998,0002,424,832