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 listSep 24, 2026 07:36Kevin HeaveyKevin HeaveyScore: 2,590Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 07:382,57129,851,29820,050,0001,039,00020,480
2Sep 24, 2026 07:382,57329,850,20920,091,0001,014,00020,480
3Sep 24, 2026 07:382,58029,878,61320,128,0001,035,00020,480
4Sep 24, 2026 07:382,58431,030,14020,161,0001,031,00020,480
5Sep 24, 2026 07:382,59029,929,60320,238,0001,006,00020,480
6Sep 24, 2026 07:382,59029,968,19920,214,0001,027,00020,480
7Sep 24, 2026 07:382,59030,022,47320,236,0001,004,00020,480
8Sep 24, 2026 07:382,61230,168,18520,421,0001,002,00020,480
9Sep 24, 2026 07:388,20075,911,57365,216,0002,027,00020,480