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 17:54anboto1anboto1Score: 24,275Success
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 17:5524,099804,652,122785,834,0009,453,0002,113,536
2Jun 7, 2026 17:5524,177807,228,360788,413,0009,436,0002,113,536
3Jun 7, 2026 17:5524,179807,434,712788,319,0009,618,0002,113,536
4Jun 7, 2026 17:5524,253809,757,555790,983,0009,375,0002,113,536
5Jun 7, 2026 17:5524,275810,500,287791,477,0009,600,0002,113,536
6Jun 7, 2026 17:5524,510821,096,193799,382,0009,466,0002,113,536
7Jun 7, 2026 17:5524,514818,661,784799,516,0009,463,0002,113,536
8Jun 7, 2026 17:5524,589820,864,296801,490,0009,972,0002,113,536
9Jun 7, 2026 17:5525,868862,886,939843,773,0009,872,0002,113,536