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 23, 2025 15:20Ian MckibbenIan MckibbenScore: 490,235Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2025 15:20488,70116,166,452,84516,021,181,000105,941,0002,326,528
2Jun 23, 2025 15:20490,23516,213,588,17916,088,817,00088,949,0002,347,008
3Jun 23, 2025 15:20493,41716,323,934,75616,175,820,000106,932,0002,437,120