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 listAug 14, 2026 18:12marko1597marko1597Score: 4,221Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 18:174,15542,412,78333,047,0001,028,0002,117,632
2Aug 14, 2026 18:174,16542,381,47833,114,0001,039,0002,117,632
3Aug 14, 2026 18:174,18742,580,09533,304,0001,034,0002,117,632
4Aug 14, 2026 18:174,21342,767,22433,531,0001,023,0002,117,632
5Aug 14, 2026 18:174,22143,736,37933,585,0001,028,0002,117,632
6Aug 14, 2026 18:174,22842,913,99733,630,0001,047,0002,117,632
7Aug 14, 2026 18:174,23243,072,89033,664,0001,039,0002,117,632
8Aug 14, 2026 18:174,25343,116,63533,848,0001,033,0002,117,632
9Aug 14, 2026 18:174,26243,908,01333,935,0001,021,0002,117,632