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 03:25anboto1anboto1Score: 5,869Success
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 03:265,846202,614,489181,668,00011,250,0002,117,632
2Jun 8, 2026 03:265,852202,317,569181,180,00011,949,0002,117,632
3Jun 8, 2026 03:265,862202,678,646181,524,00011,944,0002,117,632
4Jun 8, 2026 03:265,862202,955,144182,242,00011,231,0002,117,632
5Jun 8, 2026 03:265,869202,917,872182,431,00011,252,0002,117,632
6Jun 8, 2026 03:265,881203,377,619182,024,00012,081,0002,117,632
7Jun 8, 2026 03:265,919204,575,077183,294,00012,048,0002,117,632
8Jun 8, 2026 03:265,926205,029,306184,122,00011,439,0002,117,632
9Jun 8, 2026 03:265,947205,525,124184,808,00011,449,0002,117,632