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:39anboto1anboto1Score: 11,085Success
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:4011,052374,006,193352,074,00012,654,0002,117,632
2Jun 7, 2026 23:4011,064374,531,015352,424,00012,702,0002,117,632
3Jun 7, 2026 23:4011,065374,421,844352,536,00012,617,0002,117,632
4Jun 7, 2026 23:4011,085375,810,773353,709,00012,125,0002,117,632
5Jun 7, 2026 23:4011,085375,065,107353,119,00012,706,0002,117,632
6Jun 7, 2026 23:4011,117376,161,480354,114,00012,773,0002,117,632
7Jun 7, 2026 23:4011,166377,804,581356,416,00012,075,0002,117,632
8Jun 7, 2026 23:4011,187378,374,440356,379,00012,806,0002,117,632
9Jun 7, 2026 23:4011,191378,581,010356,457,00012,864,0002,117,632