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 30, 2026 00:05Dominique GarmierDominique GarmierScore: 32,382Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 14:3631,771953,128,872917,090,0009,990,0002,551,808
2Mar 30, 2026 00:0531,853955,590,837917,736,0008,997,0002,695,168
3Mar 30, 2026 14:3631,962958,861,375922,441,00010,993,0002,625,536
4Mar 30, 2026 00:0532,382971,445,302935,154,0008,991,0002,785,280
5Mar 30, 2026 14:3632,397971,923,966936,064,0007,992,0002,527,232
6Mar 30, 2026 00:0532,464973,928,598939,934,0006,992,0002,551,808