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 20:41anboto1anboto1Score: 12,948Success
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 20:4212,869434,506,120411,661,00013,028,0002,117,632
2Jun 7, 2026 20:4212,875434,309,339412,014,00012,880,0002,117,632
3Jun 7, 2026 20:4212,912435,346,952413,126,00012,994,0002,117,632
4Jun 7, 2026 20:4212,913435,431,673413,097,00013,035,0002,117,632
5Jun 7, 2026 20:4212,948437,117,129414,410,00012,875,0002,117,632
6Jun 7, 2026 20:4213,124442,973,819420,785,00012,333,0002,117,632
7Jun 7, 2026 20:4213,221445,973,103422,911,00013,404,0002,117,632
8Jun 7, 2026 20:4213,247446,448,313423,889,00013,268,0002,117,632
9Jun 7, 2026 20:4213,257447,118,867424,009,00013,499,0002,117,632