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 listMay 3, 2026 15:37TudyMTudyMScore: 15,049Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 15:4614,908137,799,073121,233,0001,014,0002,322,432
2May 3, 2026 15:4614,938137,806,401121,481,0001,015,0002,523,136
3May 3, 2026 15:4615,017136,983,794122,125,0001,016,0002,469,888
4May 3, 2026 15:4615,018137,291,224122,139,0001,016,0002,322,432
5May 3, 2026 15:4615,049141,305,137122,391,0001,014,0002,441,216
6May 3, 2026 15:4615,055139,298,854122,443,0001,015,0002,461,696
7May 3, 2026 15:4615,098139,188,071122,789,0001,016,0002,371,584
8May 3, 2026 15:4615,100139,059,938122,811,0001,014,0002,408,448
9May 3, 2026 15:4615,138139,322,067123,120,0001,019,0002,342,912