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 listSep 26, 2026 19:49Kevin HeaveyKevin HeaveyScore: 1,615Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 19:501,54346,311,967109,437,0001,099,000589,824
2Sep 26, 2026 19:501,54546,363,013108,184,0002,011,000589,824
3Sep 26, 2026 19:501,55246,575,322108,521,0002,010,000589,824
4Sep 26, 2026 19:501,57047,103,789107,460,0003,264,000589,824
5Sep 26, 2026 19:501,61548,466,577111,509,0001,010,000593,920
6Sep 26, 2026 19:501,63649,108,828111,244,0001,033,000573,440
7Sep 26, 2026 19:501,64149,236,760112,192,0001,012,000573,440
8Sep 26, 2026 19:501,64649,400,108111,744,0001,037,000593,920
9Sep 26, 2026 19:501,65349,597,295112,701,0001,012,000593,920