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 listApr 26, 2026 16:30TudyMTudyMScore: 70,271Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 16:3369,9792,330,024,6282,223,397,00085,938,0002,306,048
2Apr 26, 2026 16:3370,2712,337,869,0112,232,991,00085,961,0002,322,432
3Apr 26, 2026 16:3370,7252,354,109,8382,243,983,00089,959,0002,441,216