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 listJun 25, 2026 16:00Zhou180Zhou180Score: 4,096Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 16:014,05542,438,38431,023,0002,232,0002,117,632
2Jun 25, 2026 16:014,06143,009,48031,064,0002,242,0002,117,632
3Jun 25, 2026 16:014,06442,492,44531,076,0002,250,0002,117,632
4Jun 25, 2026 16:014,09443,257,94331,338,0002,234,0002,117,632
5Jun 25, 2026 16:014,09642,733,64131,352,0002,243,0002,117,632
6Jun 25, 2026 16:014,11242,901,42031,527,0002,195,0002,117,632
7Jun 25, 2026 16:014,15543,206,72531,849,0002,227,0002,117,632
8Jun 25, 2026 16:0121,881188,602,425176,234,0003,197,0002,117,632
9Jun 25, 2026 16:0122,293191,938,313179,532,0003,274,0002,117,632