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 listMar 20, 2026 20:43Yuriy LyfenkoYuriy LyfenkoScore: 5,854Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 20:435,555166,649,905398,443,00026,028,0002,633,728
2Mar 20, 2026 20:435,642169,261,263393,863,00029,913,0002,670,592
3Mar 20, 2026 20:435,727171,813,545395,291,00030,944,0002,637,824
4Mar 20, 2026 20:435,735172,046,118392,390,00030,873,0002,408,448
5Mar 20, 2026 20:435,854175,620,169395,104,00027,866,0002,564,096
6Mar 20, 2026 20:435,981179,429,564407,280,00031,865,0002,674,688
7Mar 20, 2026 20:436,102183,072,631416,722,00024,983,0002,658,304
8Mar 20, 2026 20:437,207216,216,518404,374,00035,248,0002,281,472
9Mar 20, 2026 20:438,263247,892,409423,150,00026,694,0002,551,808