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 20, 2026 20:25janwwwjanwwwScore: 5,117Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2026 20:265,063151,908,308403,801,0004,309,0002,166,784
2Oct 20, 2026 20:265,087152,625,241406,386,0004,289,0002,166,784
3Oct 20, 2026 20:265,096152,894,952406,410,0004,348,0002,166,784
4Oct 20, 2026 20:265,112153,371,817409,517,0004,291,0002,170,880
5Oct 20, 2026 20:265,117153,528,313405,441,0004,311,0002,166,784
6Oct 20, 2026 20:265,120153,626,434404,936,0004,176,0002,166,784
7Oct 20, 2026 20:265,132153,978,539407,112,0004,274,0002,166,784
8Oct 20, 2026 20:265,136154,095,338407,023,0004,139,0002,166,784
9Oct 20, 2026 20:265,172155,177,445408,869,0004,158,0002,166,784