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 24, 2026 18:47olliecrowolliecrowScore: 21,875Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 18:483,38442,778,28925,699,0002,055,0002,478,080
2Apr 24, 2026 18:483,40847,470,74824,954,0002,994,0002,453,504
3Apr 24, 2026 18:483,45151,023,27225,273,0003,032,0002,551,808
4Apr 24, 2026 18:4821,870197,657,423175,329,0004,007,0002,392,064
5Apr 24, 2026 18:4821,875195,832,643174,401,0004,982,0002,486,272
6Apr 24, 2026 18:4821,902203,593,913175,606,0003,991,0002,412,544
7Apr 24, 2026 18:4821,916204,726,445175,722,0003,993,0002,527,232
8Apr 24, 2026 18:4822,002197,991,242177,412,0003,006,0002,551,808
9Apr 24, 2026 18:4822,130199,805,957178,483,0002,991,0002,551,808