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 listDec 31, 2025 00:53Aniruddha DebAniruddha DebScore: 11,546Success
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:5311,454343,610,815269,757,00049,955,0002,752,512
2Dec 31, 2025 00:5311,467344,000,882276,576,00042,934,0002,527,232
3Dec 31, 2025 00:5311,481344,441,242265,264,00053,850,0002,711,552
4Dec 31, 2025 00:5311,497344,920,269278,567,00040,936,0002,531,328
5Dec 31, 2025 00:5311,546346,385,093271,625,00047,933,0002,637,824
6Dec 31, 2025 00:5311,580347,399,624275,869,00045,978,0002,707,456
7Dec 31, 2025 00:5311,593347,786,803271,306,00049,872,0002,637,824
8Dec 31, 2025 00:5311,665349,958,858272,451,00046,905,0002,711,552
9Dec 31, 2025 00:5311,806354,185,842277,858,00043,977,0002,535,424