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 listJan 11, 2026 03:43Josu San MartinJosu San MartinScore: 5,744Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2026 03:435,606168,177,368142,340,0002,004,0002,650,112
2Jan 11, 2026 03:435,682170,446,760142,658,0001,995,0002,781,184
3Jan 11, 2026 03:435,692170,772,069142,646,0001,995,0002,551,808
4Jan 11, 2026 03:435,734172,031,113140,660,0003,990,0002,551,808
5Jan 11, 2026 03:435,744172,325,434142,417,0002,005,0002,551,808
6Jan 11, 2026 03:435,760172,790,689140,712,0003,991,0002,551,808
7Jan 11, 2026 03:435,775173,264,787144,431,00002,523,136
8Jan 11, 2026 03:435,845175,335,225141,496,0003,010,0002,650,112
9Jan 11, 2026 03:435,896176,891,881144,685,00002,289,664