TopK Sergey Svistunov

Find the sum of the 100 largest values in 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 uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listApr 27, 2026 14:43Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 14:43064,749,969045,645,0002,396,160Exit with code 1: probe_v=input_size_1 stdin_regular=1 st_size=400000000 probe_v=input_size_1 stdin_regular=1 st_size=400000000 bytes_read=400000000 read_calls=383 eof_seen=1 elapsed_ms=43 first_read_ms=0 max_read_ms=0 mb_per_s_x1000=9302325 deadline_e...stderr