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 19:15Dominique GarmierDominique GarmierScore: 12,548Success
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 19:1510,130109,030,43078,059,0005,003,0002,433,024
2Mar 28, 2026 19:1512,548125,859,62997,898,0004,994,0002,502,656
3Mar 28, 2026 19:1512,966128,948,58198,300,0008,024,0002,510,848