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 9, 2026 21:37Victor MerckléVictor MerckléScore: 3,220Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 21:443,16594,963,850246,864,0002,203,0002,142,208
2Jun 9, 2026 21:443,18795,625,537248,362,0002,207,0002,142,208
3Jun 9, 2026 21:443,20196,058,019249,936,0002,211,0002,146,304
4Jun 9, 2026 21:443,20796,211,170250,206,0002,203,0002,142,208
5Jun 9, 2026 21:443,22096,623,955252,172,0001,042,0002,142,208
6Jun 9, 2026 21:443,22296,689,602248,335,0002,344,0002,146,304
7Jun 9, 2026 21:443,24497,326,127250,740,0002,228,0002,146,304
8Jun 9, 2026 21:443,25697,685,360252,931,0001,185,0002,146,304
9Jun 9, 2026 21:443,29498,841,625260,449,0001,104,0002,142,208