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 listApr 22, 2026 16:46olliecrowolliecrowScore: 6,274Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 16:476,236187,104,255478,953,0008,980,0002,744,320
2Apr 22, 2026 16:476,243187,310,566469,162,00010,024,0002,433,024
3Apr 22, 2026 16:476,262187,862,655478,104,00010,002,0002,682,880
4Apr 22, 2026 16:476,262187,882,818476,691,0009,993,0002,678,784
5Apr 22, 2026 16:476,274188,227,282478,282,0008,986,0002,682,880
6Apr 22, 2026 16:476,347190,412,851477,844,00010,973,0002,682,880
7Apr 22, 2026 16:476,393191,794,729479,518,0007,975,0002,678,784
8Apr 22, 2026 16:476,464193,925,191478,311,00010,006,0002,461,696
9Apr 22, 2026 16:476,516195,501,717475,688,0009,993,0002,564,096