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 11:14Victor MerckléVictor MerckléScore: 1,848Success
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 11:151,83054,904,787132,150,0002,012,0002,170,880stderr
2Sep 1, 2026 11:151,83555,050,596132,024,0002,022,0002,170,880stderr
3Sep 1, 2026 11:151,83755,116,620133,219,0001,032,0002,170,880stderr
4Sep 1, 2026 11:151,84355,314,411132,112,0002,017,0002,170,880stderr
5Sep 1, 2026 11:151,84855,441,736132,358,0001,028,0002,170,880stderr
6Sep 1, 2026 11:151,85355,606,009132,297,0002,015,0002,170,880stderr
7Sep 1, 2026 11:151,86555,958,339133,095,0002,030,0002,170,880stderr
8Sep 1, 2026 11:151,87656,291,834135,132,0001,032,0002,170,880stderr
9Sep 1, 2026 11:151,89056,727,313133,245,0001,007,0002,170,880stderr