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 listJun 19, 2025 17:51Abhigyan NiranjanAbhigyan NiranjanScore: 122,962Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2025 17:51122,31172,325,97342,238,0003,017,0002,318,336
2Jun 19, 2025 17:51122,47866,911,37143,303,0002,014,0002,318,336
3Jun 19, 2025 17:51122,50370,051,99543,312,0002,014,0002,318,336
4Jun 19, 2025 17:51122,87073,369,02344,452,0001,010,0002,318,336
5Jun 19, 2025 17:51122,96268,032,76044,485,0001,011,0002,318,336
6Jun 19, 2025 17:51123,01467,777,69745,515,00002,322,432
7Jun 19, 2025 17:51123,16577,217,96244,559,0001,012,0002,469,888
8Jun 19, 2025 17:51123,84370,683,63243,830,0001,992,0002,469,888
9Jun 19, 2025 17:51124,26873,182,75544,980,000999,0002,314,240