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 23, 2026 21:08boop34boop34Score: 9,704Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 23, 2026 21:099,677329,172,178313,981,0005,370,0002,113,536
2Jul 23, 2026 21:099,687329,486,670314,569,0005,119,0002,113,536
3Jul 23, 2026 21:099,697329,887,730314,764,0005,244,0002,113,536
4Jul 23, 2026 21:099,698329,881,996314,981,0005,071,0002,113,536
5Jul 23, 2026 21:099,704329,997,658315,269,0004,991,0002,113,536
6Jul 23, 2026 21:099,712330,320,643315,303,0005,195,0002,113,536
7Jul 23, 2026 21:099,729330,923,473316,182,0004,901,0002,113,536
8Jul 23, 2026 21:099,734331,155,825315,990,0005,241,0002,113,536
9Jul 23, 2026 21:099,747331,454,333316,518,0005,145,0002,113,536