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 listDec 31, 2025 00:48Aniruddha DebAniruddha DebScore: 9,512Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2025 00:489,463333,539,270263,403,00048,889,0002,375,680
2Dec 31, 2025 00:489,467338,258,641266,485,00045,911,0002,338,816
3Dec 31, 2025 00:489,495340,284,060261,433,00051,887,0002,449,408
4Dec 31, 2025 00:489,506342,156,871270,735,00042,958,0002,437,120
5Dec 31, 2025 00:489,512343,067,938263,904,00049,981,0002,445,312
6Dec 31, 2025 00:489,568339,620,729264,793,00050,960,0002,445,312
7Dec 31, 2025 00:489,571343,866,263268,875,00046,978,0002,285,568
8Dec 31, 2025 00:489,615343,544,194273,380,00043,900,0002,445,312
9Dec 31, 2025 00:489,947355,603,132280,374,00047,893,0002,445,312