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 listOct 3, 2024 22:29Joad NacerJoad NacerScore: 4,618Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 3, 2024 22:294,577177,298,492149,047,0002,000,0002,523,136
2Oct 3, 2024 22:294,600174,722,919149,809,0001,997,0002,527,232
3Oct 3, 2024 22:294,606179,371,484147,997,0003,999,0002,523,136
4Oct 3, 2024 22:294,618177,571,605150,403,0002,005,0002,437,120
5Oct 3, 2024 22:294,681177,205,432150,499,0003,986,0002,523,136
6Oct 3, 2024 22:294,702186,651,278151,170,0004,004,0002,326,528