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 3, 2026 23:31olliecrowolliecrowScore: 10,987Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 23:3110,838325,138,063851,429,00011,005,0002,514,944
2Mar 3, 2026 23:3110,859325,762,313853,337,00010,991,0002,600,960
3Mar 3, 2026 23:3110,871326,119,927863,057,00010,987,0002,654,208
4Mar 3, 2026 23:3110,985329,535,469875,099,00010,988,0002,404,352
5Mar 3, 2026 23:3110,987329,612,139874,217,0009,991,0002,510,848
6Mar 3, 2026 23:3111,105333,149,180854,943,00010,999,0002,625,536
7Mar 3, 2026 23:3111,107333,223,068852,080,00010,000,0002,437,120
8Mar 3, 2026 23:3111,154334,622,360883,946,00010,999,0002,596,864
9Mar 3, 2026 23:3111,269338,071,366885,763,0009,997,0002,768,896