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 26, 2026 19:12Dominique GarmierDominique GarmierScore: 69,335Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 19:1269,04646,961,84724,526,0001,021,0002,400,256
2Mar 26, 2026 19:1269,33552,640,80524,628,0001,026,0002,281,472
3Mar 26, 2026 19:1269,97650,396,37523,900,0001,991,0002,408,448