Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

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 listNov 15, 2025 00:15izotoffizotoffScore: 101,159Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 15, 2025 00:15100,0013,000,031,0632,952,749,00027,997,0002,818,048
2Nov 15, 2025 00:15100,0723,002,148,4182,969,589,00014,002,0002,564,096
3Nov 15, 2025 00:15100,2903,008,710,2702,971,205,00019,001,0002,584,576
4Nov 15, 2025 00:15100,6913,020,733,9762,979,176,00020,994,0002,654,208
5Nov 15, 2025 00:15101,1593,034,764,4282,994,632,00017,997,0002,633,728
6Nov 15, 2025 00:15101,5183,045,537,4153,007,043,00017,011,0002,691,072
7Nov 15, 2025 00:15101,8133,054,393,2703,014,098,00015,974,0002,732,032
8Nov 15, 2025 00:15103,8793,116,365,6853,073,188,00020,001,0002,510,848
9Nov 15, 2025 00:15103,9533,118,581,1423,086,418,00015,006,0002,609,152