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:10izotoffizotoffScore: 31,529Success
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:1131,304281,212,545256,692,00002,326,528
2Mar 23, 2026 00:1131,308282,468,883252,733,0003,995,0002,326,528
3Mar 23, 2026 00:1131,358283,318,793256,136,0001,000,0002,433,024
4Mar 23, 2026 00:1031,529286,574,525257,536,0001,002,0002,433,024
5Mar 23, 2026 00:1031,919291,780,616258,737,0002,996,0002,326,528
6Mar 23, 2026 00:1032,262290,600,315264,546,00002,428,928