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 22, 2026 02:35Elijah KinElijah KinScore: 68,832Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 02:3668,51634,289,90224,240,0001,111,0002,113,536
2Jun 22, 2026 02:3668,52934,407,02424,233,0001,123,0002,113,536
3Jun 22, 2026 02:3668,57834,416,66724,248,0001,126,0002,113,536
4Jun 22, 2026 02:3668,61634,525,64224,263,0001,125,0002,113,536
5Jun 22, 2026 02:3668,83234,468,67524,331,0001,137,0002,113,536
6Jun 22, 2026 02:3668,84334,474,12524,446,0001,026,0002,113,536
7Jun 22, 2026 02:3668,86734,573,57124,430,0001,051,0002,113,536
8Jun 22, 2026 02:3668,89734,591,70724,356,0001,136,0002,113,536
9Jun 22, 2026 02:3669,12136,085,66124,533,0001,042,0002,113,536