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 22, 2026 02:28olliecrowolliecrowScore: 3,593Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 02:283,48848,222,62926,566,0002,043,0002,502,656
2Apr 22, 2026 02:283,54650,208,67725,069,0004,011,0002,453,504
3Apr 22, 2026 02:283,55946,544,87624,156,0005,032,0002,297,856
4Apr 22, 2026 02:283,58745,349,88128,402,0001,014,0002,473,984
5Apr 22, 2026 02:283,59345,296,15727,438,0002,032,0002,469,888
6Apr 22, 2026 02:283,59543,782,78527,452,0002,033,0002,387,968
7Apr 22, 2026 02:283,62646,237,24926,765,0002,973,0002,465,792
8Apr 22, 2026 02:283,65549,280,33626,977,0002,997,0002,535,424
9Apr 22, 2026 02:283,91751,298,27630,118,0002,007,0002,551,808