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 26, 2026 14:31Arseniy KorobenkoArseniy KorobenkoScore: 11,627Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 14:3111,566123,698,10291,845,0002,994,0002,334,720
2Mar 26, 2026 14:3111,627116,583,73093,338,0002,007,0002,441,216
3Mar 26, 2026 14:3111,650124,731,17494,523,0001,005,0002,519,040