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 21, 2026 17:40M-RochatM-RochatScore: 21,390Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 17:4121,065631,970,450618,157,0004,180,0002,113,536
2May 21, 2026 17:4121,233637,019,711621,854,0004,143,0002,113,536
3May 21, 2026 17:4121,242637,264,201622,853,0004,205,0002,113,536
4May 21, 2026 17:4121,297638,936,061624,627,0004,145,0002,113,536
5May 21, 2026 17:4121,390641,708,531626,504,0005,073,0002,113,536
6May 21, 2026 17:4121,950658,504,377644,245,0004,214,0002,113,536
7May 21, 2026 17:4122,024660,735,681645,400,0004,175,0002,113,536
8May 21, 2026 17:4122,278668,340,616654,565,0004,176,0002,113,536
9May 21, 2026 17:4123,236697,084,827682,957,0004,031,0002,113,536