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 29, 2026 13:14Dominique GarmierDominique GarmierScore: 4,784Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 13:144,74365,475,95136,898,0001,994,0002,310,144
2Mar 29, 2026 13:144,78459,974,18134,203,0005,029,0002,355,200
3Mar 29, 2026 13:1414,233148,687,059114,715,0001,995,0002,383,872