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 listMar 17, 2026 09:22Dominique GarmierDominique GarmierScore: 12,760Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 09:2212,318369,533,555973,879,00012,998,0002,953,216
2Mar 17, 2026 09:2212,344370,330,020973,796,00014,981,0002,617,344
3Mar 17, 2026 09:2212,488374,653,611991,559,00010,972,0002,953,216
4Mar 17, 2026 09:2212,760382,788,9941,029,149,00010,980,0002,641,920
5Mar 17, 2026 09:2213,386401,582,8521,080,685,0008,989,0002,871,296
6Mar 17, 2026 09:2213,765412,952,5721,106,136,0007,986,0002,727,936