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:17anboto1anboto1Score: 27,283Success
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:1926,831896,656,306878,656,0006,787,0002,113,536
2Jun 7, 2026 17:1926,854895,605,578879,608,0006,603,0002,113,536
3Jun 7, 2026 17:1926,870896,421,438879,922,0006,788,0002,113,536
4Jun 7, 2026 17:1927,132904,776,752888,621,0006,736,0002,113,536
5Jun 7, 2026 17:1927,283910,186,847893,661,0006,684,0002,113,536
6Jun 7, 2026 17:1927,297910,234,270894,021,0006,793,0002,113,536
7Jun 7, 2026 17:1927,317911,333,207894,793,0006,684,0002,113,536
8Jun 7, 2026 17:1927,552918,522,545902,479,0006,740,0002,113,536
9Jun 7, 2026 17:1928,948964,641,925948,422,0006,890,0002,113,536