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 23, 2026 00:07izotoffizotoffScore: 31,334Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 00:0630,271273,249,497247,221,0001,000,0002,326,528
2Mar 23, 2026 00:0731,060285,446,609252,699,0001,997,0002,420,736
3Mar 23, 2026 00:0631,225287,673,807252,045,0004,000,0002,424,832
4Mar 23, 2026 00:0731,334286,869,067253,938,0002,999,0002,416,640
5Mar 23, 2026 00:0631,550289,585,356257,709,000998,0002,433,024
6Mar 23, 2026 00:0732,591297,522,175265,242,0002,001,0002,428,928