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 23:52anboto1anboto1Score: 11,116Success
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 23:5411,049373,949,701352,592,00012,026,0002,117,632
2Jun 7, 2026 23:5411,053374,119,304352,176,00012,603,0002,117,632
3Jun 7, 2026 23:5411,072375,087,754353,388,00012,012,0002,117,632
4Jun 7, 2026 23:5411,096375,467,456353,580,00012,616,0002,117,632
5Jun 7, 2026 23:5411,116376,048,575354,214,00012,635,0002,117,632
6Jun 7, 2026 23:5411,182378,252,799356,228,00012,783,0002,117,632
7Jun 7, 2026 23:5411,186378,964,761357,100,00012,068,0002,117,632
8Jun 7, 2026 23:5411,208379,168,868357,096,00012,768,0002,117,632
9Jun 7, 2026 23:5411,247382,596,633359,010,00012,165,0002,117,632