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 12, 2026 08:10Victor MerckléVictor MerckléScore: 3,105Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 08:113,08692,608,271242,189,0003,114,0002,654,208
2Jun 12, 2026 08:113,09192,735,249242,106,0003,148,0002,654,208
3Jun 12, 2026 08:113,09692,896,551240,954,0003,154,0002,654,208
4Jun 12, 2026 08:113,09992,974,561241,136,0003,067,0002,654,208
5Jun 12, 2026 08:113,10593,150,902241,841,0003,122,0002,654,208
6Jun 12, 2026 08:113,10993,271,014242,136,0003,060,0002,654,208
7Jun 12, 2026 08:113,11293,372,017242,662,0003,061,0002,654,208
8Jun 12, 2026 08:113,12093,612,265243,734,0003,194,0002,654,208
9Jun 12, 2026 08:113,14294,289,954242,348,0003,116,0002,650,112