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 19:04Elijah KinElijah KinScore: 510,230Success
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 19:04509,781218,475,105137,451,00051,168,0002,285,568
2Mar 15, 2026 19:04510,230216,391,859147,832,00040,953,0002,285,568
3Mar 15, 2026 19:04511,846221,382,265145,294,00044,089,0002,498,560