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 18, 2026 12:51Charles CabergsCharles CabergsScore: 11,891Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 12:5111,555118,601,10090,762,0003,989,0002,392,064
2Apr 18, 2026 12:5111,642123,089,08692,453,0003,014,0002,351,104
3Apr 18, 2026 12:5111,805121,826,61591,808,0004,989,0002,392,064
4Apr 18, 2026 12:5111,862120,607,01693,261,0004,011,0002,273,280
5Apr 18, 2026 12:5111,891123,688,65894,495,0003,015,0002,420,736
6Apr 18, 2026 12:5111,950128,206,62393,988,0003,999,0002,404,352
7Apr 18, 2026 12:5111,981125,464,32093,231,0005,012,0002,306,048
8Apr 18, 2026 12:5112,021132,152,73795,555,0003,017,0002,457,600
9Apr 18, 2026 12:5112,054123,958,32995,846,0002,995,0002,375,680