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 24, 2026 19:09Dominique GarmierDominique GarmierScore: 10,136Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 19:0910,093114,045,71879,769,0002,991,0002,355,200
2Mar 24, 2026 19:0910,136111,181,59180,110,0003,004,0002,269,184
3Mar 24, 2026 19:0910,155109,265,54880,265,0003,009,0002,400,256