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 listMay 1, 2026 05:21Charles CabergsCharles CabergsScore: 8,959Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 05:224,58754,372,88434,567,0003,050,0002,342,912
2May 1, 2026 05:224,60559,406,60835,721,0002,041,0002,363,392
3May 1, 2026 05:228,91590,179,43671,107,0002,003,0002,363,392
4May 1, 2026 05:228,95793,257,03370,434,0003,018,0002,535,424
5May 1, 2026 05:228,95993,144,20472,463,0001,006,0002,387,968
6May 1, 2026 05:228,96090,666,18270,461,0003,019,0002,486,272
7May 1, 2026 05:228,97999,819,59570,605,0003,025,0002,437,120
8May 1, 2026 05:228,98592,361,82472,669,0001,009,0002,375,680
9May 1, 2026 05:229,01791,743,75070,945,0002,997,0002,330,624