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 22, 2026 20:07olliecrowolliecrowScore: 6,220Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 20:086,026180,789,540442,832,00010,995,0002,555,904
2Apr 22, 2026 20:086,086182,598,563457,272,0008,966,0002,674,688
3Apr 22, 2026 20:086,132183,972,478445,774,0008,995,0002,457,600
4Apr 22, 2026 20:086,179185,381,820454,446,0009,987,0002,584,576
5Apr 22, 2026 20:086,220186,616,380458,585,0009,011,0002,695,168
6Apr 22, 2026 20:086,224186,743,661455,478,00010,010,0002,445,312
7Apr 22, 2026 20:086,226186,791,198459,243,00010,005,0002,682,880
8Apr 22, 2026 20:086,251187,557,990447,800,0007,978,0002,744,320
9Apr 22, 2026 20:086,261187,839,231454,149,0008,963,0002,686,976