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 listJan 18, 2026 06:17Josu San MartinJosu San MartinScore: 10,013Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2026 06:179,999106,685,98579,992,0001,999,0002,527,232
2Jan 18, 2026 06:1710,013109,922,92680,105,0002,002,0002,457,600
3Jan 18, 2026 06:1710,022107,988,57679,172,0003,006,0002,465,792