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 listMay 6, 2026 19:31olliecrowolliecrowScore: 15,429Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2026 19:3215,204456,143,506432,810,0005,874,0002,449,408
2May 6, 2026 19:3215,270458,115,982436,664,0005,870,0002,453,504
3May 6, 2026 19:3215,353460,593,238438,463,0005,721,0002,441,216
4May 6, 2026 19:3215,360460,807,473436,856,0005,793,0002,449,408
5May 6, 2026 19:3215,429462,886,222438,423,0005,808,0002,449,408
6May 6, 2026 19:3215,491464,754,509440,375,0005,824,0002,441,216
7May 6, 2026 19:3215,580467,423,084442,550,0005,997,0002,449,408
8May 6, 2026 19:3215,609468,295,311442,824,0005,847,0002,428,928
9May 6, 2026 19:3215,738472,155,314447,251,0005,905,0002,433,024