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 22:03Victor MerckléVictor MerckléScore: 3,518Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 22:053,485104,550,126280,171,0003,316,0002,166,784stderr
2Aug 16, 2026 22:053,492104,788,660281,348,0003,077,0002,174,976stderr
3Aug 16, 2026 22:053,492104,764,258281,230,0003,333,0002,166,784stderr
4Aug 16, 2026 22:053,494104,839,280280,727,0003,122,0002,179,072stderr
5Aug 16, 2026 22:053,518105,560,565281,541,0003,206,0002,166,784stderr
6Aug 16, 2026 22:053,523105,709,305280,678,0004,216,0002,166,784stderr
7Aug 16, 2026 22:053,530105,916,024281,925,0003,270,0002,166,784stderr
8Aug 16, 2026 22:053,543106,319,244284,925,0004,105,0002,166,784stderr
9Aug 16, 2026 22:053,551106,549,028278,539,0003,264,0002,166,784stderr