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 24, 2026 02:51Victor MerckléVictor MerckléScore: 5,852Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 02:525,755172,659,482474,569,0003,138,0002,637,824
2Jun 24, 2026 02:525,781173,457,581476,003,0003,108,0002,637,824
3Jun 24, 2026 02:525,806174,209,426477,772,0003,396,0002,637,824
4Jun 24, 2026 02:525,848175,461,966476,046,0003,063,0002,637,824
5Jun 24, 2026 02:525,852175,560,308481,769,0003,359,0002,637,824
6Jun 24, 2026 02:525,858175,755,956483,232,0003,378,0002,637,824
7Jun 24, 2026 02:525,904177,144,869489,787,0002,105,0002,633,728
8Jun 24, 2026 02:525,916177,497,298487,549,0003,347,0002,637,824
9Jun 24, 2026 02:525,921177,630,989483,516,0003,554,0002,637,824