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 28, 2026 17:56Dominique GarmierDominique GarmierScore: 39,377Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 17:5638,478345,294,183313,520,0002,003,0002,433,024
2Mar 28, 2026 17:5639,377345,696,759317,895,0004,998,0002,449,408
3Mar 28, 2026 17:5639,716354,489,963323,672,0001,997,0002,519,040