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 listApr 7, 2026 00:39olliecrowolliecrowScore: 10,006Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 7, 2026 00:449,957298,704,835688,273,00020,977,0002,842,624
2Apr 7, 2026 00:449,964298,923,108687,463,00023,946,0002,617,344
3Apr 7, 2026 00:399,986299,567,184697,067,00018,001,0002,813,952
4Apr 7, 2026 00:3910,006300,194,785692,424,00020,982,0002,555,904
5Apr 7, 2026 00:3910,156304,691,252690,272,00020,977,0002,703,360
6Apr 7, 2026 00:4410,276308,290,710691,030,00020,970,0002,371,584