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 listOct 31, 2026 07:54Andrew EpsteinAndrew EpsteinScore: 1,462Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 07:571,43643,086,33996,178,0003,062,0002,154,496stderr
2Oct 31, 2026 07:571,43843,158,30898,712,0001,256,0002,150,400stderr
3Oct 31, 2026 07:571,45843,744,590100,438,0001,118,0002,150,400stderr
4Oct 31, 2026 07:571,46043,824,475100,409,0001,019,0002,154,496stderr
5Oct 31, 2026 07:571,46243,866,122100,699,0001,013,0002,150,400stderr
6Oct 31, 2026 07:571,46643,993,195101,302,0001,018,0002,154,496stderr
7Oct 31, 2026 07:571,46844,065,952101,687,0001,026,0002,154,496stderr
8Oct 31, 2026 07:571,50445,133,634104,755,0001,016,0002,150,400stderr
9Oct 31, 2026 07:571,51545,450,772105,542,0001,011,0002,150,400stderr