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 listJun 29, 2026 19:25IlyaIlyaScore: 60,948Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 19:2660,54031,930,94721,282,0001,118,0002,113,536
2Jun 29, 2026 19:2660,79733,209,77321,287,0001,208,0002,113,536
3Jun 29, 2026 19:2660,86431,984,88021,334,0001,186,0002,113,536
4Jun 29, 2026 19:2660,86732,361,02821,331,0001,190,0002,113,536
5Jun 29, 2026 19:2660,94832,120,09321,320,0001,231,0002,113,536
6Jun 29, 2026 19:2661,01332,524,15221,351,0001,224,0002,113,536
7Jun 29, 2026 19:2661,17832,482,98821,416,0001,220,0002,113,536
8Jun 29, 2026 19:2661,18132,583,76321,421,0001,216,0002,113,536
9Jun 29, 2026 19:2661,20832,556,62621,437,0001,210,0002,113,536