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:15anboto1anboto1Score: 17,610Success
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:1617,336581,890,563559,485,00012,628,0002,117,632
2Jun 7, 2026 20:1617,341582,075,528559,586,00012,681,0002,117,632
3Jun 7, 2026 20:1617,470585,804,302563,193,00013,320,0002,117,632
4Jun 7, 2026 20:1617,588589,782,764567,294,00013,129,0002,117,632
5Jun 7, 2026 20:1617,610590,797,397568,796,00012,364,0002,117,632
6Jun 7, 2026 20:1617,646591,639,935568,977,00013,354,0002,117,632
7Jun 7, 2026 20:1617,687593,451,988570,302,00013,377,0002,117,632
8Jun 7, 2026 20:1617,701593,410,769571,613,00012,531,0002,117,632
9Jun 7, 2026 20:1617,737595,116,338572,750,00012,590,0002,117,632