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 00:26Dominique GarmierDominique GarmierScore: 169,633Success
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 00:26169,3391,408,523,6161,387,582,000999,0002,342,912
2Mar 28, 2026 00:26169,6331,420,130,0541,387,991,0002,997,0002,433,024
3Mar 28, 2026 00:26171,4721,435,831,5081,401,077,0004,996,0002,334,720