Unique strings Sergey Svistunov

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listJul 23, 2026 16:32boop34boop34Score: 13,021Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 23, 2026 16:3312,981438,142,607423,157,0005,217,0002,113,536
2Jul 23, 2026 16:3312,995438,693,956423,732,0005,132,0002,113,536
3Jul 23, 2026 16:3313,003438,940,097424,024,0005,081,0002,113,536
4Jul 23, 2026 16:3313,007439,168,022424,316,0004,944,0002,113,536
5Jul 23, 2026 16:3313,021439,529,495424,514,0005,206,0002,113,536
6Jul 23, 2026 16:3313,023439,530,246424,468,0005,302,0002,113,536
7Jul 23, 2026 16:3313,042440,245,469425,428,0004,960,0002,113,536
8Jul 23, 2026 16:3313,048440,325,180425,672,0004,917,0002,113,536
9Jul 23, 2026 16:3313,078441,454,922426,555,0005,024,0002,113,536