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 listAug 16, 2026 23:09Tomislav TunkovicTomislav TunkovicScore: 18,104Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 03:1018,078542,353,5661,574,405,0007,166,000368,640
2Aug 17, 2026 03:1018,083542,490,5721,575,550,0005,234,000356,352
3Aug 17, 2026 03:1018,094542,825,4641,579,107,0004,014,000327,680
4Aug 17, 2026 03:1018,094542,837,1291,577,342,0006,033,000118,784
5Aug 17, 2026 03:1018,104543,146,4911,579,946,0005,002,000282,624
6Aug 17, 2026 03:1018,157544,738,9841,584,056,0006,017,000368,640
7Aug 17, 2026 03:1018,183545,518,1701,587,026,0004,081,000319,488
8Aug 17, 2026 03:1018,256547,692,5361,592,311,0005,098,000118,784
9Aug 17, 2026 03:1018,260547,810,4751,586,507,0004,007,000315,392