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 9, 2026 23:10Victor MerckléVictor MerckléScore: 3,272Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 23:113,23096,915,625254,571,0002,177,0002,142,208
2Jun 9, 2026 23:113,23397,009,170254,229,0002,198,0002,142,208
3Jun 9, 2026 23:113,25197,535,952257,566,0001,022,0002,142,208
4Jun 9, 2026 23:113,26998,084,258259,807,0001,003,0002,142,208
5Jun 9, 2026 23:113,27298,168,160256,778,0002,289,0002,142,208
6Jun 9, 2026 23:113,27598,271,534255,148,0002,324,0002,146,304
7Jun 9, 2026 23:113,27798,322,299259,362,0001,006,0002,142,208
8Jun 9, 2026 23:113,29898,949,078259,720,0002,211,0002,142,208
9Jun 9, 2026 23:113,29998,984,952259,457,0002,242,0002,142,208