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 listNov 21, 2025 01:21izotoffizotoffScore: 31,828Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 21, 2025 01:2131,564946,914,963916,048,0006,000,0002,617,344
2Nov 21, 2025 01:2131,633948,996,569911,200,0007,009,0002,588,672
3Nov 21, 2025 01:2131,705951,154,756912,027,00013,000,0002,658,304
4Nov 21, 2025 01:2131,778953,340,878925,385,0004,005,0002,711,552
5Nov 21, 2025 01:2131,828954,825,083922,729,0006,011,0002,506,752
6Nov 21, 2025 01:2132,153964,595,729928,693,0005,991,0002,363,392
7Nov 21, 2025 01:2132,254967,634,006932,989,0008,008,0002,416,640
8Nov 21, 2025 01:2132,289968,659,983931,828,0007,006,0002,609,152
9Nov 21, 2025 01:2135,5841,067,522,1271,038,305,0006,001,0002,592,768