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 listMar 15, 2026 21:22Elijah KinElijah KinScore: 160,446Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 21:22159,71690,102,01818,029,00041,066,0002,322,432
2Mar 15, 2026 21:22160,44685,940,37612,074,00047,291,0002,326,528
3Mar 15, 2026 21:22162,80387,278,43411,043,00049,194,0002,273,280