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 listJul 7, 2026 22:25Victor MerckléVictor MerckléScore: 3,061Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 22:293,01190,342,951232,495,0003,422,0002,674,688
2Jul 7, 2026 22:293,01490,434,299231,758,0003,657,0002,674,688
3Jul 7, 2026 22:293,03891,165,672235,686,0003,408,0002,674,688
4Jul 7, 2026 22:293,03891,143,089235,639,0003,417,0002,674,688
5Jul 7, 2026 22:293,06191,836,411237,089,0003,699,0002,670,592
6Jul 7, 2026 22:293,06792,026,293235,456,0004,701,0002,740,224
7Jul 7, 2026 22:293,07292,180,121237,386,0003,712,0002,674,688
8Jul 7, 2026 22:293,07692,306,593238,503,0003,447,0002,674,688
9Jul 7, 2026 22:293,10193,047,301239,403,0003,723,0002,670,592