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 listJan 9, 2026 18:37Pavel SkripkinPavel SkripkinScore: 62,332Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2026 18:3761,9272,075,877,0722,033,593,0009,993,0002,387,968
2Jan 9, 2026 18:3762,0512,078,475,8402,037,693,0009,993,0002,281,472
3Jan 9, 2026 18:3762,0922,077,671,5362,041,029,0007,996,0002,514,944
4Jan 9, 2026 18:3762,2332,083,705,4832,044,694,0008,994,0002,269,184
5Jan 9, 2026 18:3762,3322,088,888,0462,048,953,0007,995,0002,281,472
6Jan 9, 2026 18:3762,5962,092,844,3972,056,667,0008,994,0002,281,472
7Jan 9, 2026 18:3762,6052,094,304,6182,056,971,0008,995,0002,461,696
8Jan 9, 2026 18:3762,7012,097,851,1042,060,134,0008,996,0002,424,832
9Jan 9, 2026 18:3762,8762,101,303,3422,065,913,0008,995,0002,281,472