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 24, 2025 22:08Dmitry YudakovDmitry YudakovScore: 183,265Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2025 22:08176,7515,862,930,0865,806,804,00025,985,0002,379,776
2Apr 24, 2025 22:08183,2656,080,135,8386,014,760,00032,982,0002,318,336
3Apr 24, 2025 22:08185,5676,157,409,4446,101,712,00021,984,0002,547,712