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 25, 2026 05:56Dominique GarmierDominique GarmierScore: 226,965Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 05:56226,703114,483,58080,885,0002,995,0002,355,200
2Mar 25, 2026 05:56226,965109,528,65680,978,0002,999,0002,441,216
3Mar 25, 2026 05:56230,503106,054,45781,273,0004,013,0002,498,560