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 18:55Victor MerckléVictor MerckléScore: 1,681Success
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 18:561,67650,281,142118,676,0001,032,0002,170,880stderr
2Aug 23, 2026 18:561,67850,350,799118,379,0001,015,0002,170,880stderr
3Aug 23, 2026 18:561,67950,377,535119,867,0002,027,0002,170,880stderr
4Aug 23, 2026 18:561,68150,446,289119,556,0001,039,0002,170,880stderr
5Aug 23, 2026 18:561,68150,434,890120,769,0001,274,0002,170,880stderr
6Aug 23, 2026 18:561,68650,604,074121,289,0001,272,0002,170,880stderr
7Aug 23, 2026 18:561,68950,694,355120,873,0002,025,0002,170,880stderr
8Aug 23, 2026 18:561,70551,172,434120,366,0001,013,0002,170,880stderr
9Aug 23, 2026 18:561,71451,432,428123,517,0001,252,0002,170,880stderr