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 20, 2026 01:22Dominique GarmierDominique GarmierScore: 18,624Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 01:1018,578174,599,144150,337,0002,004,0002,404,352
2Mar 20, 2026 00:4818,584173,852,595150,386,0002,005,0002,445,312
3Mar 20, 2026 00:4818,585173,627,532151,397,0001,002,0002,437,120
4Mar 20, 2026 00:4818,623182,347,934150,712,0001,996,0002,437,120
5Mar 20, 2026 01:1018,624180,312,021148,726,0003,992,0002,433,024
6Mar 20, 2026 01:1018,624181,668,558150,723,0001,996,0002,318,336
7Mar 20, 2026 01:2218,625178,646,177151,727,000998,0002,383,872
8Mar 20, 2026 01:2218,635185,252,177150,808,0001,997,0002,408,448
9Mar 20, 2026 01:2218,642181,395,829151,862,000999,0002,420,736