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 listMay 12, 2026 23:56Josu San MartinJosu San MartinScore: 3,938Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 23:573,921138,309,762128,347,0001,067,0002,113,536
2May 12, 2026 23:573,926138,473,357128,521,0001,057,0002,113,536
3May 12, 2026 23:573,934140,293,672128,802,0001,050,0002,113,536
4May 12, 2026 23:573,935138,636,219128,726,0001,129,0002,113,536
5May 12, 2026 23:573,938138,816,448128,854,0001,121,0002,113,536
6May 12, 2026 23:573,939138,862,849128,888,0001,127,0002,113,536
7May 12, 2026 23:573,949139,464,502129,199,0001,120,0002,113,536
8May 12, 2026 23:573,950141,160,651129,264,0001,113,0002,113,536
9May 12, 2026 23:573,971139,865,779129,940,0001,108,0002,113,536