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 30, 2026 19:13TonyTonyScore: 101,748Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 19:14101,6373,049,126,1242,959,534,00076,826,0002,121,728
2Jul 30, 2026 19:14101,6813,050,432,1022,959,015,00077,904,0002,121,728
3Jul 30, 2026 19:14101,7233,051,715,0522,961,805,00077,067,0002,121,728
4Jul 30, 2026 19:14101,7233,051,694,8012,959,860,00078,993,0002,121,728
5Jul 30, 2026 19:14101,7483,052,456,4862,960,641,00079,056,0002,121,728
6Jul 30, 2026 19:14101,7723,053,181,8462,960,835,00079,269,0002,121,728
7Jul 30, 2026 19:14101,7923,053,780,2882,962,063,00078,620,0002,121,728
8Jul 30, 2026 19:14101,7973,053,921,4052,962,984,00078,070,0002,117,632
9Jul 30, 2026 19:14101,9433,058,298,1032,965,037,00080,232,0002,121,728