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 05:26Andrew EpsteinAndrew EpsteinScore: 1,510Success
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 05:291,48244,461,985102,880,0001,089,0002,166,784
2Oct 31, 2026 05:291,48344,505,718102,547,0001,171,0002,158,592
3Oct 31, 2026 05:291,50045,005,810104,420,0001,128,0002,166,784
4Oct 31, 2026 05:291,51045,311,361105,253,0001,088,0002,158,592
5Oct 31, 2026 05:291,51045,303,845105,190,0001,132,0002,166,784
6Oct 31, 2026 05:291,51145,343,744105,397,0001,084,0002,158,592
7Oct 31, 2026 05:291,51645,483,126105,225,0001,187,0002,158,592
8Oct 31, 2026 05:291,52345,703,734106,227,0001,166,0002,166,784
9Oct 31, 2026 05:291,52745,821,959106,399,0001,178,0002,158,592