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 13, 2026 13:10Victor MerckléVictor MerckléScore: 3,292Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 13:123,23196,948,532247,875,0003,289,0002,699,264
2Jun 13, 2026 13:123,23897,155,148249,429,0003,287,0002,699,264
3Jun 13, 2026 13:123,25297,562,384250,479,0003,306,0002,453,504
4Jun 13, 2026 13:123,29198,730,802251,379,0003,195,0002,699,264
5Jun 13, 2026 13:123,29298,773,391249,929,0003,344,0002,699,264
6Jun 13, 2026 13:123,29398,793,052251,243,0003,281,0002,699,264
7Jun 13, 2026 13:123,29798,939,829253,500,0003,211,0002,699,264
8Jun 13, 2026 13:123,31999,580,193252,862,0003,285,0002,699,264
9Jun 13, 2026 13:123,360100,808,173253,636,0003,278,0002,699,264