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 31, 2025 00:18Aniruddha DebAniruddha DebScore: 9,964Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2025 00:189,905353,136,823283,880,00042,981,0002,347,008
2Dec 31, 2025 00:189,923353,314,231280,541,00046,923,0002,347,008
3Dec 31, 2025 00:189,931354,731,858278,765,00048,958,0002,506,752
4Dec 31, 2025 00:189,957352,613,589284,650,00043,946,0002,527,232
5Dec 31, 2025 00:189,964352,480,791284,846,00043,976,0002,289,664
6Dec 31, 2025 00:189,965352,666,224284,862,00043,978,0002,506,752
7Dec 31, 2025 00:189,986353,680,596284,592,00044,935,0002,506,752
8Dec 31, 2025 00:1810,033360,804,826296,179,00034,903,0002,347,008
9Dec 31, 2025 00:1810,037353,411,759282,338,00048,885,0002,539,520