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 29, 2026 13:32TudyMTudyMScore: 11,340Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 13:3310,737322,113,063863,227,00014,003,0002,564,096
2Apr 29, 2026 13:3310,892326,769,192865,322,00020,007,0002,572,288
3Apr 29, 2026 13:3311,198335,968,448926,002,00010,000,0002,654,208
4Apr 29, 2026 13:3311,324339,743,859919,128,00016,983,0002,842,624
5Apr 29, 2026 13:3311,340340,223,737922,516,00012,979,0002,744,320
6Apr 29, 2026 13:3311,375341,259,435921,263,00015,987,0002,686,976
7Apr 29, 2026 13:3311,389341,696,893917,336,00017,967,0002,740,224
8Apr 29, 2026 13:3311,433343,019,670918,214,00017,984,0002,760,704
9Apr 29, 2026 13:3311,570347,120,764924,331,00011,991,0002,502,656