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 listFeb 6, 2025 09:15NoSIMD_C#NoSIMD_C#Score: 87,430Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 6, 2025 09:1586,3392,875,557,6162,795,219,00053,965,0002,306,048
2Feb 6, 2025 09:1587,4302,915,768,1012,831,220,00053,966,0002,306,048
3Feb 6, 2025 09:1587,7932,927,755,7332,851,189,00045,970,0002,560,000