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 listApr 15, 2026 21:34zielajzielajScore: 2,842Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 15, 2026 21:342,80744,342,28822,017,0001,000,0002,510,848
2Apr 15, 2026 21:342,84250,350,58521,275,0002,026,0002,289,664
3Apr 15, 2026 21:345,32572,479,05543,667,00002,502,656