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 listSep 1, 2026 06:43Victor MerckléVictor MerckléScore: 1,757Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 06:441,72051,619,847123,059,0002,028,0002,166,784stderr
2Sep 1, 2026 06:441,73452,030,379123,648,0002,056,0002,166,784stderr
3Sep 1, 2026 06:441,74252,273,238124,120,0002,018,0002,166,784stderr
4Sep 1, 2026 06:441,75552,673,255125,077,0001,224,0002,166,784stderr
5Sep 1, 2026 06:441,75752,720,562124,646,0001,036,0002,170,880stderr
6Sep 1, 2026 06:441,76052,821,653125,443,0001,037,0002,170,880stderr
7Sep 1, 2026 06:441,76152,841,734123,207,0001,045,0002,170,880stderr
8Sep 1, 2026 06:441,77353,208,654124,074,0001,038,0002,170,880stderr
9Sep 1, 2026 06:441,77653,292,652124,960,0001,048,0002,170,880stderr