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 listSep 28, 2026 19:24C21C21Score: 24,500Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2026 19:2522,966985,757,84047,080,000141,247,00020,480
2Sep 28, 2026 19:2523,092989,041,48547,029,000142,329,00020,480
3Sep 28, 2026 19:2523,120995,377,10747,178,000142,408,00020,480
4Sep 28, 2026 19:2524,388986,034,14856,881,000143,108,00020,480
5Sep 28, 2026 19:2524,5001,000,537,81158,746,000142,162,00020,480
6Sep 28, 2026 19:2524,5011,005,897,02356,832,000144,083,00020,480
7Sep 28, 2026 19:2524,6081,017,733,11958,946,000142,847,00020,480
8Sep 28, 2026 19:2524,8951,023,896,38358,676,000145,467,00020,480
9Sep 28, 2026 19:2526,205854,696,28143,598,000171,285,00020,480