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 25, 2025 02:13Ian MckibbenIan MckibbenScore: 15,008Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2025 02:1314,929515,304,019420,704,00071,949,0002,408,448
2Jun 25, 2025 02:1314,930515,719,537412,753,00079,952,0002,314,240
3Jun 25, 2025 02:1314,958516,596,466425,680,00067,949,0002,306,048
4Jun 25, 2025 02:1314,963517,126,179417,824,00075,968,0002,359,296
5Jun 25, 2025 02:1315,008519,684,846413,376,00081,876,0002,318,336
6Jun 25, 2025 02:1315,013515,935,504410,526,00084,902,0002,416,640
7Jun 25, 2025 02:1315,018520,779,186421,666,00073,941,0002,527,232
8Jun 25, 2025 02:1315,048518,536,368419,635,00076,933,0002,306,048
9Jun 25, 2025 02:1315,069522,125,711422,381,00074,890,0002,322,432