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 8, 2026 06:40Rajarshi BasuRajarshi BasuScore: 79,563Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 06:4074,264635,632,056499,973,000108,994,0002,285,568
2Jan 8, 2026 06:4079,563678,434,351525,528,000126,886,0002,301,952
3Jan 8, 2026 06:4086,524739,609,968593,577,000115,917,0002,306,048