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:48zielajzielajScore: 3,643Success
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:543,618142,669,447113,385,0006,020,0002,367,488
2Dec 31, 2025 00:473,626144,221,859111,691,0007,977,0002,342,912
3Dec 31, 2025 00:543,626145,933,089111,678,0007,977,0002,342,912
4Dec 31, 2025 00:473,627144,921,347111,697,0007,978,0002,486,272
5Dec 31, 2025 00:483,643144,075,906112,198,0008,014,0002,326,528
6Dec 31, 2025 00:543,651145,315,643112,450,0008,032,0002,342,912
7Dec 31, 2025 00:473,660142,662,945114,792,0005,989,0002,342,912
8Dec 31, 2025 00:483,684148,859,929116,578,0004,981,0002,301,952
9Dec 31, 2025 00:483,718151,787,769114,704,0007,979,0002,347,008