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 4, 2026 02:45olliecrowolliecrowScore: 10,052Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 02:459,824294,708,167769,052,0009,987,0002,387,968
2Mar 4, 2026 02:459,968299,049,551768,642,0009,995,0002,428,928
3Mar 4, 2026 02:4510,010300,301,618772,723,0009,983,0002,379,776
4Mar 4, 2026 02:4510,047301,411,720772,262,0009,977,0002,584,576
5Mar 4, 2026 02:4510,052301,551,260769,494,0008,994,0002,535,424
6Mar 4, 2026 02:4510,060301,805,295770,949,0009,011,0002,510,848
7Mar 4, 2026 02:4510,062301,848,468771,030,00011,000,0002,379,776
8Mar 4, 2026 02:4510,324309,729,765771,529,00010,006,0002,400,256
9Mar 4, 2026 02:4510,352310,566,300786,531,0009,981,0002,347,008