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 16:49anboto1anboto1Score: 31,349Success
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 16:5030,7091,025,400,4931,007,598,0005,816,0002,113,536
2Jun 7, 2026 16:5031,0261,033,704,6031,018,081,0005,779,0002,113,536
3Jun 7, 2026 16:5031,0581,034,794,2931,019,907,0005,031,0002,113,536
4Jun 7, 2026 16:5031,2501,040,556,5331,026,252,0005,019,0002,113,536
5Jun 7, 2026 16:5031,3491,044,070,2691,028,717,0005,810,0002,113,536
6Jun 7, 2026 16:5031,3771,045,282,2991,029,641,0005,811,0002,113,536
7Jun 7, 2026 16:5031,4041,046,160,5451,030,644,0005,693,0002,113,536
8Jun 7, 2026 16:5033,5521,116,908,0061,102,205,0005,019,0002,113,536
9Jun 7, 2026 16:5033,7691,124,196,2751,109,221,0005,167,0002,113,536