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:09anboto1anboto1Score: 13,912Success
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:1013,596458,462,324436,071,00012,613,0002,117,632
2Jun 7, 2026 20:1013,679460,956,086438,525,00012,902,0002,117,632
3Jun 7, 2026 20:1013,692461,290,318438,835,00013,019,0002,117,632
4Jun 7, 2026 20:1013,774464,117,455441,355,00013,213,0002,117,632
5Jun 7, 2026 20:1013,912468,653,959445,666,00013,449,0002,117,632
6Jun 7, 2026 20:1013,943469,376,789447,603,00012,539,0002,117,632
7Jun 7, 2026 20:1014,045473,177,608451,075,00012,419,0002,117,632
8Jun 7, 2026 20:1014,097474,891,036451,808,00013,421,0002,117,632
9Jun 7, 2026 20:1014,131476,051,818453,009,00013,329,0002,117,632