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 listDec 30, 2025 22:16Aniruddha DebAniruddha DebScore: 16,258Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 30, 2025 22:1715,731471,938,775418,600,00026,974,0002,617,344
2Dec 30, 2025 22:1715,781473,433,252413,143,00034,927,0002,732,032
3Dec 30, 2025 22:1715,804474,117,876410,998,00036,910,0002,539,520
4Dec 30, 2025 22:1616,258487,750,369435,254,00030,946,0002,584,576
5Dec 30, 2025 22:1616,399491,976,830435,302,00029,952,0002,650,112
6Dec 30, 2025 22:1616,413492,401,008426,676,00038,879,0002,621,440