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 listMar 30, 2026 21:05Dominique GarmierDominique GarmierScore: 9,528Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 21:059,525102,089,10977,102,0001,001,0002,494,464
2Mar 30, 2026 21:059,528107,132,14875,128,0003,005,0002,486,272
3Mar 30, 2026 21:0512,531134,026,89198,763,0003,990,0002,404,352