Unique strings Sergey Svistunov

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 listJun 7, 2026 20:02anboto1anboto1Score: 19,378Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 20:0319,182642,322,373619,756,00013,265,0002,117,632
2Jun 7, 2026 20:0319,322648,981,854624,682,00012,947,0002,117,632
3Jun 7, 2026 20:0319,336647,887,260624,639,00013,468,0002,117,632
4Jun 7, 2026 20:0319,371648,899,382626,678,00012,586,0002,117,632
5Jun 7, 2026 20:0319,378648,804,945626,158,00013,340,0002,117,632
6Jun 7, 2026 20:0319,412650,402,253627,103,00013,500,0002,117,632
7Jun 7, 2026 20:0319,471652,312,716629,204,00013,371,0002,117,632
8Jun 7, 2026 20:0319,483652,194,885629,562,00013,385,0002,117,632
9Jun 7, 2026 20:0319,811662,970,161640,324,00013,471,0002,117,632