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 27, 2026 05:57Victor MerckléVictor MerckléScore: 3,026Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 06:013,00790,229,863233,167,0003,445,0002,678,784
2Jun 27, 2026 06:013,01990,582,041233,111,0003,496,0002,678,784
3Jun 27, 2026 06:013,02190,636,982235,025,0003,501,0002,674,688
4Jun 27, 2026 06:013,02290,685,058235,250,0003,468,0002,670,592
5Jun 27, 2026 06:013,02690,807,960234,867,0003,142,0002,670,592
6Jun 27, 2026 06:013,03290,978,865234,948,0003,466,0002,674,688
7Jun 27, 2026 06:013,04191,231,735235,728,0003,440,0002,674,688
8Jun 27, 2026 06:013,04291,268,290235,596,0003,504,0002,670,592
9Jun 27, 2026 06:013,06892,061,360234,774,0004,458,0002,736,128