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 listAug 16, 2026 23:13Tomislav TunkovicTomislav TunkovicScore: 38,315Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 05:0838,0661,265,189,2901,252,112,0004,075,00045,056
2Aug 17, 2026 05:0838,1321,267,164,6291,254,295,0004,068,00045,056
3Aug 17, 2026 05:0838,1571,270,017,3771,255,113,0004,093,00045,056
4Aug 17, 2026 05:0838,2021,269,508,9781,256,609,0004,083,00045,056
5Aug 17, 2026 05:0838,3151,275,705,5351,260,354,0004,057,00045,056
6Aug 17, 2026 05:0838,4331,277,066,8931,264,214,0004,082,00045,056
7Aug 17, 2026 05:0838,5191,281,565,6581,267,074,0004,070,00045,056
8Aug 17, 2026 05:0838,6981,285,784,0431,273,963,0003,080,00098,304
9Aug 17, 2026 05:0839,0331,296,939,4341,284,044,0004,064,00045,056