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 15:49Victor MerckléVictor MerckléScore: 6,605Success
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 15:576,569197,074,682554,452,0001,024,0002,170,880stderr
2Aug 23, 2026 15:576,573197,199,290559,267,0002,036,0002,170,880stderr
3Aug 23, 2026 15:576,583197,499,404557,381,0001,032,0002,170,880stderr
4Aug 23, 2026 15:576,599197,970,437559,880,0002,005,0002,170,880stderr
5Aug 23, 2026 15:576,605198,153,030560,526,0002,026,0002,170,880stderr
6Aug 23, 2026 15:576,612198,379,184560,805,0002,050,0002,170,880stderr
7Aug 23, 2026 15:576,615198,479,568560,181,0003,034,0002,170,880stderr
8Aug 23, 2026 15:576,653199,592,686563,357,0001,019,0002,170,880stderr
9Aug 23, 2026 15:576,694200,830,003566,633,0002,018,0002,170,880stderr