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 29, 2026 01:19Victor MerckléVictor MerckléScore: 3,051Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 01:233,00590,163,218232,997,0003,672,0002,674,688
2Jun 29, 2026 01:233,00890,262,051232,954,0003,644,0002,674,688
3Jun 29, 2026 01:233,04491,331,469236,294,0003,629,0002,674,688
4Jun 29, 2026 01:233,04991,491,010236,958,0003,691,0002,674,688
5Jun 29, 2026 01:233,05191,553,457237,080,0003,746,0002,740,224
6Jun 29, 2026 01:233,07092,100,707238,647,0003,673,0002,674,688
7Jun 29, 2026 01:233,07892,352,751238,937,0003,410,0002,670,592
8Jun 29, 2026 01:233,08392,517,429238,264,0003,632,0002,674,688
9Jun 29, 2026 01:233,09292,777,309238,831,0003,688,0002,678,784