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 26, 2026 02:54Victor MerckléVictor MerckléScore: 2,869Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 02:552,84085,225,139229,782,0001,018,0002,658,304
2Jun 26, 2026 02:552,85585,676,592229,450,0003,063,0002,658,304
3Jun 26, 2026 02:552,85785,716,183230,351,0002,046,0002,658,304
4Jun 26, 2026 02:552,85885,768,972229,501,0003,156,0002,658,304
5Jun 26, 2026 02:552,86986,083,214230,348,0003,153,0002,658,304
6Jun 26, 2026 02:552,87786,314,262231,301,0003,087,0002,658,304
7Jun 26, 2026 02:552,92987,872,572231,489,0003,128,0002,654,208
8Jun 26, 2026 02:552,93788,123,874233,390,0002,072,0002,658,304
9Jun 26, 2026 02:552,95588,668,808233,623,0003,038,0002,658,304