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 15, 2026 21:49Victor MerckléVictor MerckléScore: 5,685Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 21:505,605168,168,755463,622,0006,415,0002,572,288stderr
2Aug 15, 2026 21:505,607168,235,271463,638,0007,581,0002,564,096stderr
3Aug 15, 2026 21:505,607168,238,597463,958,0006,775,0002,572,288stderr
4Aug 15, 2026 21:505,628168,849,686467,242,0007,870,0002,564,096stderr
5Aug 15, 2026 21:505,685170,576,178469,164,0007,949,0002,564,096stderr
6Aug 15, 2026 21:505,702171,084,477473,526,0007,715,0002,564,096stderr
7Aug 15, 2026 21:505,717171,524,821474,468,0007,792,0002,564,096stderr
8Aug 15, 2026 21:505,790173,723,412478,190,0007,986,0002,564,096stderr
9Aug 15, 2026 21:505,812174,361,843481,204,0006,846,0002,572,288stderr