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 29, 2026 21:46Dominique GarmierDominique GarmierScore: 115,439Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 21:46115,356972,619,411945,921,00002,363,392
2Mar 29, 2026 22:20115,374975,156,903946,068,00002,363,392
3Mar 29, 2026 22:20115,436968,908,355944,578,0001,999,0002,318,336
4Mar 29, 2026 21:46115,439971,427,979944,603,0001,999,0002,359,296
5Mar 29, 2026 21:46115,534976,148,911947,375,00002,351,104
6Mar 29, 2026 22:20115,863975,145,788945,080,0004,995,0002,392,064