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 listApr 24, 2026 08:09olliecrowolliecrowScore: 36,842Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 08:123,58147,528,66926,330,0003,038,0002,387,968
2Apr 24, 2026 08:123,60937,863,84727,554,0002,041,0002,473,984
3Apr 24, 2026 08:1236,788310,212,916297,671,0003,995,0002,494,464
4Apr 24, 2026 08:1236,808310,545,045296,835,0004,997,0002,396,160
5Apr 24, 2026 08:1236,842309,666,142300,098,0002,007,0002,367,488
6Apr 24, 2026 08:1236,886310,990,712298,480,0003,993,0002,469,888
7Apr 24, 2026 08:1237,113311,855,713301,327,0003,003,0002,441,216
8Apr 24, 2026 08:1237,221312,737,112301,212,0004,002,0002,523,136
9Apr 24, 2026 08:1237,276313,345,827300,672,0004,994,0002,498,560