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 04:00Victor MerckléVictor MerckléScore: 3,640Success
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 04:013,575107,259,041290,428,0001,034,0002,170,880stderr
2Aug 16, 2026 04:013,585107,567,721290,903,0001,063,0002,170,880stderr
3Aug 16, 2026 04:013,600108,003,455293,689,0001,020,0002,166,784stderr
4Aug 16, 2026 04:013,613108,395,549291,316,0001,047,0002,170,880stderr
5Aug 16, 2026 04:013,640109,225,799296,842,0001,023,0002,166,784stderr
6Aug 16, 2026 04:013,646109,383,419292,594,0001,066,0002,170,880stderr
7Aug 16, 2026 04:013,666109,988,429296,641,0001,053,0002,166,784stderr
8Aug 16, 2026 04:013,669110,084,145299,277,0001,016,0002,166,784stderr
9Aug 16, 2026 04:013,708111,254,617297,943,0002,317,0002,170,880stderr