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 listMar 4, 2026 03:28olliecrowolliecrowScore: 10,145Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 03:289,879296,366,380766,458,00011,991,0002,416,640
2Mar 4, 2026 03:289,926297,780,502767,458,00010,005,0002,547,712
3Mar 4, 2026 03:289,984299,506,989773,959,0009,999,0002,609,152
4Mar 4, 2026 03:2810,053301,586,324765,590,00010,994,0002,412,544
5Mar 4, 2026 03:2810,145304,342,459768,158,00010,002,0002,400,256
6Mar 4, 2026 03:2810,156304,691,138768,321,0009,991,0002,551,808
7Mar 4, 2026 03:2810,175305,259,663798,410,0009,992,0002,510,848
8Mar 4, 2026 03:2810,241307,243,767769,080,00012,001,0002,473,984
9Mar 4, 2026 03:2810,250307,499,300795,905,0008,998,0002,363,392