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 30, 2026 07:28Victor MerckléVictor MerckléScore: 77,853Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 07:2977,652654,774,609633,750,0002,998,0002,351,104stderr
2Apr 30, 2026 07:2977,678656,593,111633,961,0002,999,0002,461,696stderr
3Apr 30, 2026 07:2977,734659,503,386634,424,0002,997,0002,310,144stderr
4Apr 30, 2026 07:2977,829654,620,389636,198,0002,000,0002,428,928stderr
5Apr 30, 2026 07:2977,853658,056,969635,399,0002,997,0002,490,368stderr
6Apr 30, 2026 07:2977,854660,781,590631,410,0006,993,0002,379,776stderr
7Apr 30, 2026 07:2977,878652,194,094635,602,0002,998,0002,564,096stderr
8Apr 30, 2026 07:2977,903665,323,134634,811,0003,998,0002,428,928stderr
9Apr 30, 2026 07:2977,987658,004,244636,500,0002,997,0002,506,752stderr