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 20, 2026 00:19olliecrowolliecrowScore: 7,074Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 00:006,948208,439,724510,935,00011,975,0002,564,096
2Mar 20, 2026 00:007,061211,832,068515,944,00010,977,0002,514,944
3Mar 20, 2026 00:197,062211,865,332514,675,00010,971,0002,609,152
4Mar 20, 2026 00:197,074212,205,062509,402,00012,934,0002,330,624
5Mar 20, 2026 00:007,133213,975,526511,737,0008,995,0002,564,096
6Mar 20, 2026 00:197,139214,164,951517,000,0009,961,0002,600,960