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 25, 2026 04:59limanjun99limanjun99Score: 42,149Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 05:0040,257350,007,222325,107,0005,001,0002,396,160
2Apr 25, 2026 05:0041,305353,904,716333,709,0004,995,0002,449,408
3Apr 25, 2026 05:0041,583358,474,407335,983,0004,999,0002,400,256
4Apr 25, 2026 05:0042,120365,034,895341,381,0004,004,0002,539,520
5Apr 25, 2026 05:0042,149363,411,060341,631,0003,995,0002,387,968
6Apr 25, 2026 05:0042,446364,499,865343,064,0005,000,0002,490,368
7Apr 25, 2026 05:0042,654364,178,491344,768,0004,996,0002,514,944
8Apr 25, 2026 05:0043,097370,063,011350,393,0003,003,0002,551,808
9Apr 25, 2026 05:0044,195378,298,074359,396,0003,003,0002,379,776