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 listNov 4, 2026 04:53e1011e1011Score: 120,784Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2026 04:54105,482875,942,681722,271,000142,683,0002,113,536
2Nov 4, 2026 04:54110,575917,620,441766,212,000140,504,0002,113,536
3Nov 4, 2026 04:54113,814944,240,805790,891,000142,385,0002,113,536
4Nov 4, 2026 04:54117,157971,681,704817,898,000142,794,0002,113,536
5Nov 4, 2026 04:54120,7841,001,804,405849,867,000140,565,0002,113,536
6Nov 4, 2026 04:54132,7861,099,903,002947,421,000141,430,0002,113,536
7Nov 4, 2026 04:54140,0241,159,624,4721,008,143,000140,060,0002,113,536
8Nov 4, 2026 04:54154,9111,281,683,8261,129,566,000140,705,0002,113,536
9Nov 4, 2026 04:54167,5891,385,220,9351,233,591,000140,639,0002,113,536