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 23, 2026 16:40Victor MerckléVictor MerckléScore: 3,552Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 16:413,527105,816,437286,916,0001,082,0002,170,880stderr
2Aug 23, 2026 16:413,532105,976,658286,982,0001,136,0002,170,880stderr
3Aug 23, 2026 16:413,548106,440,832288,360,0001,133,0002,170,880stderr
4Aug 23, 2026 16:413,551106,536,068288,778,0001,002,0002,170,880stderr
5Aug 23, 2026 16:413,552106,584,164286,137,0001,045,0002,170,880stderr
6Aug 23, 2026 16:413,563106,893,522288,779,0001,095,0002,170,880stderr
7Aug 23, 2026 16:413,567107,016,285286,933,0001,056,0002,170,880stderr
8Aug 23, 2026 16:413,597107,936,320291,435,0001,060,0002,170,880stderr
9Aug 23, 2026 16:413,600108,001,430288,847,0001,067,0002,170,880stderr