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 8, 2026 02:04anboto1anboto1Score: 9,909Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 02:059,684329,425,872307,693,00011,911,0002,117,632
2Jun 8, 2026 02:059,726330,348,601308,433,00012,545,0002,117,632
3Jun 8, 2026 02:059,762331,463,702309,529,00012,634,0002,117,632
4Jun 8, 2026 02:059,832333,699,735311,726,00012,761,0002,117,632
5Jun 8, 2026 02:059,909336,670,749314,958,00012,043,0002,117,632
6Jun 8, 2026 02:059,913336,507,011314,514,00012,634,0002,117,632
7Jun 8, 2026 02:059,921336,667,845314,809,00012,606,0002,117,632
8Jun 8, 2026 02:059,939337,261,957315,378,00012,611,0002,117,632
9Jun 8, 2026 02:059,997339,173,299317,275,00012,645,0002,117,632