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 19, 2026 08:52Victor MerckléVictor MerckléScore: 3,692Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 08:533,618108,541,411290,684,0003,096,0002,637,824
2Jun 19, 2026 08:533,624108,739,801291,994,0003,189,0002,637,824
3Jun 19, 2026 08:533,682110,468,558294,767,0003,138,0002,637,824
4Jun 19, 2026 08:533,689110,684,347298,661,0003,269,0002,637,824
5Jun 19, 2026 08:533,692110,779,714294,641,0003,050,0002,633,728
6Jun 19, 2026 08:533,695110,857,780292,723,0003,192,0002,633,728
7Jun 19, 2026 08:533,702111,084,547298,833,0003,429,0002,408,448
8Jun 19, 2026 08:533,744112,344,186299,638,0003,071,0002,408,448
9Jun 19, 2026 08:533,801114,031,300303,311,0003,227,0002,637,824