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 29, 2026 13:33TudyMTudyMScore: 124,307Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 13:36123,6971,034,371,6281,012,323,0001,996,0002,297,856
2Apr 29, 2026 13:36123,9011,038,338,6771,012,997,0002,994,0002,367,488
3Apr 29, 2026 13:36123,9351,035,625,6621,015,274,000998,0002,371,584
4Apr 29, 2026 13:36124,2941,038,922,2991,017,218,0001,996,0002,301,952
5Apr 29, 2026 13:36124,3071,041,928,6341,016,326,0002,995,0002,363,392
6Apr 29, 2026 13:36124,3241,043,756,7091,017,468,0001,996,0002,383,872
7Apr 29, 2026 13:36124,9981,042,652,2291,021,996,0002,994,0002,289,664
8Apr 29, 2026 13:36125,0681,047,340,4641,023,566,0001,997,0002,359,296
9Apr 29, 2026 13:36125,1201,045,299,0921,023,996,0001,996,0002,293,760