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 6, 2026 14:02Victor MerckléVictor MerckléScore: 4,495Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 14:034,415132,478,677363,155,0004,359,0002,646,016
2Jun 6, 2026 14:034,422132,677,104362,814,0004,558,0002,646,016
3Jun 6, 2026 14:034,437133,128,695362,333,0004,363,0002,646,016
4Jun 6, 2026 14:034,471134,135,002367,028,0004,329,0002,641,920
5Jun 6, 2026 14:034,495134,858,510369,594,0004,439,0002,646,016
6Jun 6, 2026 14:034,501135,059,433367,714,0004,293,0002,641,920
7Jun 6, 2026 14:034,507135,235,782369,121,0004,576,0002,641,920
8Jun 6, 2026 14:034,526135,785,362369,606,0004,462,0002,650,112
9Jun 6, 2026 14:034,557136,723,991372,941,0003,498,0002,646,016