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 9, 2026 14:28olliecrowolliecrowScore: 22,767Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 8, 2026 16:0022,272668,145,5051,819,880,00087,849,0002,686,976
2Apr 8, 2026 16:0022,450673,485,9141,833,339,00073,892,0002,617,344
3Apr 9, 2026 14:2822,543676,299,5891,825,441,00080,930,0002,760,704
4Apr 9, 2026 14:2822,767683,002,7261,864,501,00068,870,0002,891,776
5Apr 9, 2026 14:2823,047691,419,1361,846,714,00081,810,0002,719,744
6Apr 8, 2026 16:0023,658709,736,5181,834,140,00084,775,0002,719,744