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 19, 2026 15:36Andrew EpsteinAndrew EpsteinScore: 19,851Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 15:372,74631,940,94421,516,0001,009,00020,480
2Sep 19, 2026 15:372,75132,020,44821,506,0001,058,00020,480
3Sep 19, 2026 15:372,75432,092,78521,541,0001,044,00020,480
4Sep 19, 2026 15:3719,430168,152,644158,298,0001,032,00020,480
5Sep 19, 2026 15:3719,851171,657,802161,735,0001,047,00020,480
6Sep 19, 2026 15:3720,008174,181,111163,013,0001,057,00020,480
7Sep 19, 2026 15:3720,079174,152,231163,611,0001,037,00020,480
8Sep 19, 2026 15:3720,649178,745,147168,256,0001,066,00020,480
9Sep 19, 2026 15:3720,650178,685,137168,303,0001,033,00020,480