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 7, 2026 22:55anboto1anboto1Score: 11,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 7, 2026 22:5611,189378,574,028357,719,00011,541,0002,117,632
2Jun 7, 2026 22:5611,231380,018,173359,005,00011,645,0002,117,632
3Jun 7, 2026 22:5611,355383,970,846363,184,00011,536,0002,117,632
4Jun 7, 2026 22:5611,361386,687,052363,305,00011,610,0002,117,632
5Jun 7, 2026 22:5611,372384,533,939363,604,00011,679,0002,117,632
6Jun 7, 2026 22:5611,372384,598,909363,738,00011,538,0002,117,632
7Jun 7, 2026 22:5611,388385,087,863364,114,00011,720,0002,117,632
8Jun 7, 2026 22:5611,422386,258,549365,165,00011,768,0002,117,632
9Jun 7, 2026 22:5611,489388,608,072368,018,00011,136,0002,117,632