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 listMar 17, 2026 17:42T PrathamT PrathamScore: 42,496Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 17:4242,441375,952,420345,018,0003,000,0002,383,872
2Mar 17, 2026 17:4242,496374,240,688346,468,0002,002,0002,265,088
3Mar 17, 2026 17:4242,709373,943,971349,211,0001,000,0002,351,104