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 listApr 4, 2025 19:52NoSIMD_C#NoSIMD_C#Score: 94,379Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 4, 2025 19:5293,5733,111,730,3443,045,930,00041,971,0002,469,888
2Apr 4, 2025 19:5294,3793,144,846,4043,064,535,00049,959,0002,506,752
3Apr 4, 2025 19:5294,7563,154,684,9763,085,966,00040,973,0002,301,952