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 8, 2026 00:56anboto1anboto1Score: 10,677Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 00:5710,577358,888,992337,068,00011,992,0002,117,632
2Jun 8, 2026 00:5710,598359,006,500337,165,00012,598,0002,117,632
3Jun 8, 2026 00:5710,618360,189,660338,388,00012,010,0002,117,632
4Jun 8, 2026 00:5710,661361,061,261339,129,00012,714,0002,117,632
5Jun 8, 2026 00:5710,677362,176,687340,202,00012,148,0002,117,632
6Jun 8, 2026 00:5710,683361,850,015339,662,00012,883,0002,117,632
7Jun 8, 2026 00:5710,694362,208,322340,190,00012,727,0002,117,632
8Jun 8, 2026 00:5710,699362,402,267340,360,00012,726,0002,117,632
9Jun 8, 2026 00:5710,782365,060,397342,982,00012,836,0002,117,632