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 listAug 14, 2026 22:30Tomislav TunkovicTomislav TunkovicScore: 3,538Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 22:313,495104,851,362227,969,00056,865,0002,166,784stderr
2Aug 14, 2026 22:313,496104,885,076229,900,00055,880,0002,166,784stderr
3Aug 14, 2026 22:313,497104,927,517229,303,00056,084,0002,166,784stderr
4Aug 14, 2026 22:313,527105,818,393230,343,00055,271,0002,166,784stderr
5Aug 14, 2026 22:313,538106,157,932234,419,00055,752,0002,166,784stderr
6Aug 14, 2026 22:313,544106,337,958233,965,00055,715,0002,166,784stderr
7Aug 14, 2026 22:313,562106,887,311236,198,00055,953,0002,166,784stderr
8Aug 14, 2026 22:313,574107,225,793234,643,00057,378,0002,166,784stderr
9Aug 14, 2026 22:313,583107,511,518233,710,00056,673,0002,162,688stderr