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 listJun 16, 2026 02:52Victor MerckléVictor MerckléScore: 3,102Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 16, 2026 02:533,08392,506,364244,576,0001,052,0002,654,208
2Jun 16, 2026 02:533,08892,641,741240,848,0003,254,0002,654,208
3Jun 16, 2026 02:533,08892,660,373241,128,0003,131,0002,654,208
4Jun 16, 2026 02:533,09992,984,081243,424,0001,037,0002,654,208
5Jun 16, 2026 02:533,10293,088,852241,416,0003,134,0002,654,208
6Jun 16, 2026 02:533,11593,477,903243,705,0003,177,0002,654,208
7Jun 16, 2026 02:533,11593,456,927244,633,0003,142,0002,650,112
8Jun 16, 2026 02:533,17195,153,670244,817,0002,039,0002,650,112
9Jun 16, 2026 02:533,18195,456,811244,751,0003,085,0002,654,208