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 listMay 22, 2026 19:30M-RochatM-RochatScore: 25,552Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 19:3125,406762,197,907740,955,0009,615,0002,113,536
2May 22, 2026 19:3125,467764,031,287742,162,0009,852,0002,113,536
3May 22, 2026 19:3125,479764,386,919744,746,0009,640,0002,113,536
4May 22, 2026 19:3125,538766,154,051745,109,0009,578,0002,113,536
5May 22, 2026 19:3125,552766,563,044745,246,0009,611,0002,113,536
6May 22, 2026 19:3125,630768,924,206744,220,00012,027,0002,113,536
7May 22, 2026 19:3125,639769,195,541746,982,0009,724,0002,113,536
8May 22, 2026 19:3125,748772,469,212750,725,0009,919,0002,113,536
9May 22, 2026 19:3125,759772,792,081748,975,00012,034,0002,113,536