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:37TudyMTudyMScore: 20,925Success
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:4220,559616,779,9311,726,371,00012,995,0002,547,712
2Apr 29, 2026 13:4220,707621,215,6321,729,160,00012,001,0002,764,800
3Apr 29, 2026 13:4220,757622,719,6861,721,627,00014,005,0002,576,384
4Apr 29, 2026 13:4220,862625,881,9141,727,882,00015,989,0002,625,536
5Apr 29, 2026 13:4220,925627,753,8311,733,863,00013,990,0002,510,848
6Apr 29, 2026 13:4221,198635,952,0021,801,845,0007,999,0002,768,896
7Apr 29, 2026 13:4221,338640,161,3561,799,915,0009,993,0002,781,184
8Apr 29, 2026 13:4221,454643,623,8831,795,851,00015,989,0002,588,672
9Apr 29, 2026 13:4221,501645,039,4991,801,069,00011,987,0002,551,808