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 listApr 3, 2026 16:45Ondřej PolaneckýOndřej PolaneckýScore: 25,100Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2026 16:4524,965858,142,744801,845,00021,995,0002,387,968
2Apr 3, 2026 16:4524,965851,357,296798,853,00024,995,0002,392,064
3Apr 3, 2026 16:4524,990852,547,052802,684,00021,991,0002,281,472
4Apr 3, 2026 16:4525,045858,507,785807,483,00018,987,0002,355,200
5Apr 3, 2026 16:4525,100854,780,971800,326,00027,976,0002,473,984
6Apr 3, 2026 16:4525,116859,770,481804,832,00023,995,0002,473,984
7Apr 3, 2026 16:4525,181860,124,972807,014,00023,970,0002,281,472
8Apr 3, 2026 16:4525,429871,110,624814,174,00024,974,0002,281,472
9Apr 3, 2026 16:4525,586868,204,413819,358,00024,980,0002,383,872