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 listJul 3, 2026 14:22A_ShamanA_ShamanScore: 88,871Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 14:2488,0522,641,574,7362,589,603,00041,796,0002,113,536
2Jul 3, 2026 14:2488,3782,651,352,7592,599,644,00041,834,0002,113,536
3Jul 3, 2026 14:2488,4172,652,516,5112,600,716,00041,884,0002,113,536
4Jul 3, 2026 14:2488,7952,663,868,6632,612,305,00041,742,0002,113,536
5Jul 3, 2026 14:2488,8712,666,156,9652,614,306,00041,660,0002,113,536
6Jul 3, 2026 14:2488,9232,667,704,3502,615,640,00042,182,0002,113,536
7Jul 3, 2026 14:2488,9312,667,930,2072,616,221,00041,955,0002,117,632
8Jul 3, 2026 14:2489,0052,670,177,9642,618,949,00041,579,0002,117,632
9Jul 3, 2026 14:2489,4742,684,238,6272,623,353,00042,268,0002,113,536