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 8, 2026 01:30Victor MerckléVictor MerckléScore: 3,059Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 01:373,01290,378,128232,932,0003,663,0002,674,688
2Jul 8, 2026 01:373,01790,514,096233,447,0003,477,0002,670,592
3Jul 8, 2026 01:373,05391,590,383236,670,0003,476,0002,674,688
4Jul 8, 2026 01:373,05991,783,400237,315,0003,444,0002,674,688
5Jul 8, 2026 01:373,07792,318,855238,839,0003,469,0002,674,688
6Jul 8, 2026 01:373,08092,405,661237,941,0003,688,0002,674,688