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 listApr 23, 2026 22:36olliecrowolliecrowScore: 6,706Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 22:376,620198,605,670493,149,0009,962,0002,674,688
2Apr 23, 2026 22:376,648199,468,103491,949,00010,019,0002,719,744
3Apr 23, 2026 22:376,651199,557,678494,364,00010,027,0002,768,896
4Apr 23, 2026 22:376,702201,074,733500,941,0009,998,0002,437,120
5Apr 23, 2026 22:376,706201,202,623503,483,0009,989,0002,678,784
6Apr 23, 2026 22:376,760202,816,736498,384,00010,986,0002,674,688
7Apr 23, 2026 22:376,797203,910,709497,699,0009,993,0002,723,840
8Apr 23, 2026 22:376,829204,891,494503,021,0008,964,0002,457,600
9Apr 23, 2026 22:376,860205,806,667505,146,00010,002,0002,678,784