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 23:23Charles CabergsCharles CabergsScore: 12,045Success
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 23:2411,838355,151,604993,832,00010,965,0002,756,608
2Apr 29, 2026 23:2411,936358,100,5921,008,160,00010,969,0002,564,096
3Apr 29, 2026 23:2411,957358,728,0821,009,536,0009,965,0002,650,112
4Apr 29, 2026 23:2411,967359,022,8481,000,312,0008,984,0002,793,472
5Apr 29, 2026 23:2412,045361,370,6601,017,280,0009,983,0002,994,176
6Apr 29, 2026 23:2412,057361,736,3301,006,454,00012,992,0002,805,760
7Apr 29, 2026 23:2412,065361,970,663997,059,00012,974,0002,985,984
8Apr 29, 2026 23:2412,086362,607,7881,006,378,0008,985,0002,568,192
9Apr 29, 2026 23:2412,236367,104,8621,014,246,0008,975,0002,977,792