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:48anboto1anboto1Score: 11,113Success
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:4910,943370,455,705348,674,00012,461,0002,117,632
2Jun 7, 2026 23:4910,983372,097,135350,460,00012,005,0002,117,632
3Jun 7, 2026 23:4911,013372,842,439350,734,00012,703,0002,117,632
4Jun 7, 2026 23:4911,078374,870,192352,937,00012,653,0002,117,632
5Jun 7, 2026 23:4911,113376,511,949354,576,00012,158,0002,117,632
6Jun 7, 2026 23:4911,115376,062,661354,752,00012,073,0002,117,632
7Jun 7, 2026 23:4911,120376,358,145354,971,00012,011,0002,117,632
8Jun 7, 2026 23:4911,128376,544,417354,488,00012,761,0002,117,632
9Jun 7, 2026 23:4911,142377,012,606354,950,00012,750,0002,117,632