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 listSep 10, 2025 19:17Aleksei ShahoikaAleksei ShahoikaScore: 113,189Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2025 19:17112,69766,485,40740,681,0001,017,0002,265,088
2Sep 10, 2025 19:17113,18967,645,46939,886,0001,994,0002,285,568
3Sep 10, 2025 19:17113,63569,818,50140,043,0002,002,0002,273,280