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 listAug 18, 2026 02:34Victor MerckléVictor MerckléScore: 1,966Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 02:401,90657,200,848141,207,0001,274,0002,170,880stderr
2Aug 18, 2026 02:401,92657,792,048139,716,0001,055,0002,170,880stderr
3Aug 18, 2026 02:401,93558,056,700143,527,0002,043,0002,170,880stderr
4Aug 18, 2026 02:401,95558,676,610144,930,0001,059,0002,170,880stderr
5Aug 18, 2026 02:401,96658,991,606145,906,0002,042,0002,170,880stderr
6Aug 18, 2026 02:401,97659,298,043146,626,0001,284,0002,170,880stderr
7Aug 18, 2026 02:401,97959,394,140146,421,0001,039,0002,170,880stderr
8Aug 18, 2026 02:402,00960,293,203149,027,0001,030,0002,170,880stderr
9Aug 18, 2026 02:402,01360,391,409148,166,0001,035,0002,170,880stderr