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 24, 2025 00:16zielajzielajScore: 4,026Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2025 00:164,020162,853,592124,681,0007,979,0002,289,664
2Dec 24, 2025 00:164,020158,966,980123,694,0008,977,0002,396,160
3Dec 24, 2025 00:164,025157,669,589124,829,0007,989,0002,473,984
4Dec 24, 2025 00:164,026162,348,832119,870,00012,985,0002,428,928
5Dec 24, 2025 00:164,026155,821,349123,869,0008,990,0002,387,968
6Dec 24, 2025 00:164,035153,316,662121,151,00012,015,0002,301,952
7Dec 24, 2025 00:164,038160,685,738125,253,0008,016,0002,306,048
8Dec 24, 2025 00:164,039159,636,366120,274,00013,029,0002,412,544
9Dec 24, 2025 00:164,049155,615,043120,646,00012,961,0002,469,888