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 11, 2025 19:37Leon ZhaoLeon ZhaoScore: 206,807Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2025 19:37204,9636,803,149,6056,742,807,00020,986,0002,457,600
2Aug 11, 2025 19:37205,5276,817,385,6866,761,413,00020,988,0002,289,664
3Aug 11, 2025 19:37206,0786,833,554,3116,776,608,00023,980,0002,404,352
4Aug 11, 2025 19:37206,4396,849,946,4206,791,511,00020,986,0002,383,872
5Aug 11, 2025 19:37206,8076,860,591,9836,803,656,00020,983,0002,514,944
6Aug 11, 2025 19:37207,5096,881,112,9296,828,795,00018,988,0002,301,952
7Aug 11, 2025 19:37208,0306,899,095,3766,842,001,00022,986,0002,392,064
8Aug 11, 2025 19:37208,2616,907,451,1186,849,618,00022,985,0002,519,040
9Aug 11, 2025 19:37208,9256,931,894,0786,879,541,00014,990,0002,498,560