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 listJul 8, 2026 02:09Victor MerckléVictor MerckléScore: 2,988Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 02:112,89986,994,755229,449,0003,188,0002,707,456
2Jul 8, 2026 02:112,91587,458,807229,713,0003,124,0002,707,456
3Jul 8, 2026 02:112,97089,110,016231,383,0003,175,0002,707,456
4Jul 8, 2026 02:112,98589,566,861232,277,0003,176,0002,703,360
5Jul 8, 2026 02:112,98889,646,625232,011,0003,130,0002,703,360
6Jul 8, 2026 02:112,98989,698,573232,908,0003,206,0002,703,360
7Jul 8, 2026 02:113,00190,037,786232,355,0003,311,0002,699,264
8Jul 8, 2026 02:113,02090,605,548234,383,0003,170,0002,707,456
9Jul 8, 2026 02:113,04891,450,893233,652,0003,177,0002,699,264