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 listJun 8, 2026 14:34anboto1anboto1Score: 6,372Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 14:356,358219,079,963200,567,0009,263,0002,117,632
2Jun 8, 2026 14:356,359219,151,953201,596,0008,260,0002,117,632
3Jun 8, 2026 14:356,362219,720,757200,796,0009,173,0002,117,632
4Jun 8, 2026 14:356,368219,464,423200,862,0009,293,0002,117,632
5Jun 8, 2026 14:356,372219,997,163201,077,0009,222,0002,117,632
6Jun 8, 2026 14:356,376219,673,612201,157,0009,251,0002,117,632
7Jun 8, 2026 14:356,430221,599,925202,885,0009,335,0002,117,632
8Jun 8, 2026 14:356,436222,171,354203,081,0009,307,0002,117,632
9Jun 8, 2026 14:356,438221,775,389203,165,0009,307,0002,117,632