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 23:50Tomislav TunkovicTomislav TunkovicScore: 2,804Success
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 23:512,79231,984,90621,795,0001,104,0002,117,632stderr
2Aug 14, 2026 23:512,79832,030,25521,832,0001,116,0002,117,632stderr
3Aug 14, 2026 23:512,80132,022,96621,861,0001,114,0002,117,632stderr
4Aug 14, 2026 23:512,80131,747,81621,860,0001,116,0002,117,632stderr
5Aug 14, 2026 23:512,80432,051,64921,888,0001,107,0002,117,632stderr
6Aug 14, 2026 23:512,80932,072,22321,920,0001,118,0002,117,632stderr
7Aug 14, 2026 23:512,83832,372,87222,158,0001,118,0002,117,632stderr
8Aug 14, 2026 23:512,84631,828,80022,214,0001,129,0002,117,632stderr
9Aug 14, 2026 23:512,85840,780,80722,384,0001,057,0002,117,632stderr