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 18:37anboto1anboto1Score: 22,409Success
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 18:3822,062737,861,931721,328,0006,721,0002,113,536
2Jun 7, 2026 18:3822,133739,718,487723,526,0006,871,0002,113,536
3Jun 7, 2026 18:3822,137740,295,048723,904,0006,631,0002,113,536
4Jun 7, 2026 18:3822,334746,824,144730,152,0006,890,0002,113,536
5Jun 7, 2026 18:3822,409749,188,341732,721,0006,800,0002,113,536
6Jun 7, 2026 18:3822,436750,134,525733,382,0007,023,0002,113,536
7Jun 7, 2026 18:3823,422782,625,888766,878,0006,058,0002,113,536
8Jun 7, 2026 18:3823,434783,114,746766,226,0007,121,0002,113,536
9Jun 7, 2026 18:3823,515785,331,629768,868,0007,139,0002,113,536