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 listJul 22, 2026 20:57boop34boop34Score: 15,451Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 20:5815,243513,253,681479,241,00023,792,0002,113,536
2Jul 22, 2026 20:5815,332516,701,297482,771,00023,208,0002,113,536
3Jul 22, 2026 20:5815,358516,879,156482,965,00023,875,0002,113,536
4Jul 22, 2026 20:5815,384517,776,310484,381,00023,300,0002,113,536
5Jul 22, 2026 20:5815,451520,435,129486,076,00023,808,0002,113,536
6Jul 22, 2026 20:5815,691527,818,241493,937,00023,897,0002,113,536
7Jul 22, 2026 20:5815,750529,813,229496,912,00022,849,0002,113,536
8Jul 22, 2026 20:5815,777530,634,891497,394,00023,247,0002,113,536
9Jul 22, 2026 20:5815,947536,258,776502,643,00023,629,0002,113,536