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 listJul 2, 2026 14:46A_ShamanA_ShamanScore: 13,700Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 14:4713,611120,958,346109,598,0002,019,0002,113,536
2Jul 2, 2026 14:4713,647121,228,051109,829,0002,080,0002,113,536
3Jul 2, 2026 14:4713,649121,208,698109,907,0002,021,0002,113,536
4Jul 2, 2026 14:4713,660121,355,061109,952,0002,064,0002,113,536
5Jul 2, 2026 14:4713,700121,653,534110,326,0002,022,0002,113,536
6Jul 2, 2026 14:4713,716122,164,672110,439,0002,035,0002,113,536
7Jul 2, 2026 14:4713,728121,925,534110,535,0002,040,0002,113,536
8Jul 2, 2026 14:4713,746122,033,932110,647,0002,076,0002,113,536
9Jul 2, 2026 14:4713,830122,705,457111,244,0002,168,0002,113,536