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 listSep 25, 2026 09:01Kevin HeaveyKevin HeaveyScore: 1,621Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2026 09:021,61648,506,787105,745,0001,011,000569,344
2Sep 25, 2026 09:021,61948,583,760105,536,0001,004,000598,016
3Sep 25, 2026 09:021,62048,620,960105,816,0001,002,000589,824
4Sep 25, 2026 09:021,62048,620,655105,593,0001,061,000569,344
5Sep 25, 2026 09:021,62148,652,912104,857,0002,014,000569,344
6Sep 25, 2026 09:021,62248,664,612104,911,0002,015,000589,824
7Sep 25, 2026 09:021,63048,922,381106,317,0001,058,000589,824
8Sep 25, 2026 09:021,63248,970,638106,770,0001,003,000589,824
9Sep 25, 2026 09:021,63248,975,720106,673,0001,003,000589,824