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 3, 2025 05:29NoSIMD_C#NoSIMD_C#Score: 135,452Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2025 05:29134,5534,469,822,2194,414,279,00025,983,0002,510,848
2Feb 3, 2025 05:29135,4524,504,023,8604,443,928,00025,982,0002,281,472
3Feb 3, 2025 05:29137,1194,554,813,8394,503,935,00020,985,0002,347,008