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 04:59olliecrowolliecrowScore: 10,023Success
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 04:599,945298,342,250772,253,00011,003,0002,527,232
2Mar 4, 2026 04:599,953298,579,021774,304,00011,989,0002,555,904
3Mar 4, 2026 04:599,979299,369,865771,225,0009,989,0002,379,776
4Mar 4, 2026 04:599,991299,739,896769,603,0009,994,0002,748,416
5Mar 4, 2026 04:5910,023300,683,511770,180,0009,989,0002,502,656
6Mar 4, 2026 04:5910,047301,422,808768,093,00012,001,0002,371,584
7Mar 4, 2026 04:5910,049301,463,710772,308,0009,991,0002,342,912
8Mar 4, 2026 04:5910,072302,152,058774,178,0008,978,0002,387,968
9Mar 4, 2026 04:5910,181305,422,556771,184,00010,002,0002,387,968