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 03:50Victor MerckléVictor MerckléScore: 3,076Success
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 03:543,04691,398,521241,969,0001,041,0002,170,880stderr
2Aug 16, 2026 03:543,05391,613,189242,140,0001,080,0002,170,880stderr
3Aug 16, 2026 03:543,05691,692,913240,559,0002,324,0002,170,880stderr
4Aug 16, 2026 03:543,06892,044,500242,549,0001,061,0002,170,880stderr
5Aug 16, 2026 03:543,07692,296,695244,363,0001,027,0002,166,784stderr
6Aug 16, 2026 03:543,08392,511,619244,804,0001,032,0002,166,784stderr
7Aug 16, 2026 03:543,08492,528,341243,465,0001,055,0002,170,880stderr
8Aug 16, 2026 03:543,09292,768,265244,260,0001,062,0002,170,880stderr
9Aug 16, 2026 03:543,12093,609,601243,791,0002,073,0002,170,880stderr