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 listDec 23, 2025 03:02Joad NacerJoad NacerScore: 4,654Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 23, 2025 03:024,555178,390,359146,318,0004,008,0002,441,216
2Dec 23, 2025 03:024,619180,683,402149,411,0003,008,0002,437,120
3Dec 23, 2025 03:024,631180,510,522150,821,0001,997,0002,482,176
4Dec 23, 2025 03:024,654181,810,369150,576,0002,991,0002,506,752
5Dec 23, 2025 03:025,544206,009,824177,956,0004,998,0002,445,312
6Dec 23, 2025 03:025,764214,657,853187,210,0003,003,0002,453,504