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 listMay 24, 2025 15:49Emanuele BolognesiEmanuele BolognesiScore: 46,520Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2025 15:4946,3301,556,856,3681,508,896,00019,985,0002,289,664
2May 24, 2025 15:4946,5201,560,299,7361,522,169,00012,992,0002,342,912
3May 24, 2025 15:4946,6871,572,393,8651,527,675,00012,988,0002,400,256